Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 3 Next »

Note: This page is WIP.


Analysis

Data and continuations size

Data cost

Transfer from Bob to Alice


Continuations cost

Transfer from Bob to Alice




Trie size

Leaf cost

Leafs are cheap themselves, the data usage comes from the size of data stored.

Skip cost

Skip nodes take up 1.7kb for 90kb of pointerblocks.

Node cost




Other data

LMDB












Takeaways/next steps

  1. Work through checkpoint creation (1 step instead of 13 steps) which would reduce the amount of stored tries (less data)  RCHAIN-3415 - Getting issue details... STATUS
  2. Address EmptyPointer stored in Node pointer block.  RCHAIN-3226 - Getting issue details... STATUS








  • No labels