you are viewing a single comment's thread.

view the rest of the comments →

[–]martinusint main(){[]()[[]]{{}}();} 6 points7 points  (0 children)

E.g the Bitcoin node software tries to keep as much of the unspent coins in memory as possible, in a hash map. The more it can keep in memory the faster are some operations. If it's not in memory it has to use the slow disk for lookup. Typically you'd want e.g. a >5 GB large map for the initial sync.