Page Comparison

...

1. Work through checkpoint creation (1 step instead of 13 steps) which would reduce the amount of stored tries (less data) 

   Jira Legacy
   server System JIRA serverId 50130123-f232-3df4-bccb-c16e7d83cd3e key RCHAIN-3415

   1. estimated gain:
      1. store of top level pointerblock (4416 + 4512 + 128) instead of 44992 (80%)
      2. note: this calculation is very imprecise as the change will happen (is possible) in next rspace
   2. Address EmptyPointer stored in Node pointer block. 

      Jira Legacy
      server System JIRA serverId 50130123-f232-3df4-bccb-c16e7d83cd3e key RCHAIN-3226

      1. encode pointer type in 2 bits, not in 8 bits
      2. explore gain from storing sparse vectors
2. Continue analysis of rholang AST
   
   1. we can address the source size (which is constant but it constitutes a 10% or 15% of the data stored)
   2. there is no way of addressing the random state

Trie Merging in RSpace Next

Transfer from A → B, existing wallets.

https://docs.google.com/spreadsheets/d/1v5MJhKyzu1WgzAQo51rHt0TNXeBOffbQ9bUgldxHeUw/edit?usp=sharing

The trie structure weighs 7020 bytes.

It's easy to observe that there is one central PointerBlock which weighs 4929 bytes.

This cost seems to be very close to the lower bound for any change to the trie. This would dictate that any actions on a block should focus on performing as much actions in memory and committing (checkpointing) as seldom as possible.

This also points to work done in