mirror of
https://github.com/monero-project/monero-site.git
synced 2024-12-23 12:09:49 +00:00
Adjusted FAQ 'How big is the Monero blockchain?'
This commit is contained in:
parent
be81f4b8a8
commit
22e280eb83
1 changed files with 1 additions and 1 deletions
|
@ -431,7 +431,7 @@ faq:
|
|||
qfullpruned: How do I decide if I should run a full node or a pruned node?
|
||||
afullpruned: "A full @node requires a considerable amount of storage and could take a long time to download and verify the entire blockchain, especially on older hardware. If you have limited storage, a pruned node is recommended. It only stores 1/8th of unnecessary blockchain data while keeping the full transaction history. If plenty of storage is available, a full node is recommended but a pruned node still greatly contributes to the network and improves your privacy."
|
||||
qblocksize: How big is the Monero blockchain?
|
||||
ablocksize: "The Monero @blockchain is always growing so there is no fixed size. As of 2021, the blockchain is around 95-100GB. "
|
||||
ablocksize: "The Monero @blockchain is always growing so there is no fixed size. As of 2021, the full-node blockchain is around 95-100GB. Pruned-node blockchain is 30GB. Check out Moneropedia entry @pruning to learn the difference between full-node and pruned-node blockchain."
|
||||
qblockspace: Why does the blockchain need so much space?
|
||||
ablockspace: "When you download the @blockchain, you are downloading the entire history of the @transactions that happened in the Monero network since it was created. The transactions and the related data are heavy and the entire history must be kept by every node to ensure it's the same for everybody. @pruning a blockchain allows to run a node which keeps only 1/8 of not strictly necessary blockchain data. This results in a blockchain 2/3 smaller than a full one. Convenient for people with limited disk space. Check out the Moneropedia entries @node and @remote-node for more details."
|
||||
qavoidbc: Can I avoid downloading the entire blockchain?
|
||||
|
|
Loading…
Reference in a new issue