Topic: Nano (RaiBlocks) Rebranding (Read 94 times)
We may now expect huge marketing efforts & partnerships and Nano can pave its way block by block
advantages of Nano (RaiBlocks)
Zero Fees
Because the protocol is incredibly lightweight and running a node costs next to nothing, RaiBlocks transactions are processed with no fees. One transaction fits within a single UDP packet, and transactions are handled independently, eliminating any block size issue.
Instantaneous Transaction Speed
Wallets pre-cache the anti-spam Proof of Work for the next transaction once a transaction is sent, making transactions instantaneous, as both sides have the proof of work ready to go. For ongoing transactions there may be delays, but this is intentional to prevent transaction spam.
Scalability
Transaction lookups scale with the logarithm of the data set size logNO with a tree-like structure or O1 if they are based on a hash table. To get an idea of how this scales, if it was a simple binary tree with 1,000 entries it would take 10 lookups. With 1,000,000 entries it takes 20 and 1 billion would take 30. Pruned nodes only need to keep the latest block of each account-chain, even further reducing lookup time and system resources.
https://medium.com/@nanocurrency/nano-rebrand-announcement-9101528a7b76
Zero Fees
Because the protocol is incredibly lightweight and running a node costs next to nothing, RaiBlocks transactions are processed with no fees. One transaction fits within a single UDP packet, and transactions are handled independently, eliminating any block size issue.
Instantaneous Transaction Speed
Wallets pre-cache the anti-spam Proof of Work for the next transaction once a transaction is sent, making transactions instantaneous, as both sides have the proof of work ready to go. For ongoing transactions there may be delays, but this is intentional to prevent transaction spam.
Scalability
Transaction lookups scale with the logarithm of the data set size logNO with a tree-like structure or O1 if they are based on a hash table. To get an idea of how this scales, if it was a simple binary tree with 1,000 entries it would take 10 lookups. With 1,000,000 entries it takes 20 and 1 billion would take 30. Pruned nodes only need to keep the latest block of each account-chain, even further reducing lookup time and system resources.
https://medium.com/@nanocurrency/nano-rebrand-announcement-9101528a7b76
Jump to: