Note: This page is WIP.
Analysis
Data and continuations size
Data cost
A simple datum
Code Block |
---|
@42 <- "test" |
...
channel: Par
...
a: ListParWithRandom
...
Transfer from Bob to Alice
Continuations cost
...
...
for(x <- @42) {Nil}
...
channels: Seq[Par]
...
patterns: Seq[BindPattern]
...
continuation: TaggedContinuation
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
- 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 - Address EmptyPointer stored in Node pointer block.
Jira Legacy server System JIRA serverId 50130123-f232-3df4-bccb-c16e7d83cd3e key RCHAIN-3226