E
to E’
, the pointers above it need to be updated as well. This then changes C
to C’
, and thus A
to A’
(“A revision 1”). All other links can be copied over (B
and D
remain at their previous revision 0). We are using the term ”revision” to avoid the word ”version” which conflicts with the version of WNFS itself.<A’, C’, E’>
. The rest is shared structurally. Thus, B
originated in Generation 0, but is a member of both Generations 0 and 1.previous
to the older version of the vnode. This also makes validation that the DAG has been non-destructively appended with a Merkle proof that A
exists inside A’
.O(log n)
history access. So for instance, 502 back would be achieved in 7 operations, 728 in 5, and 1M in 7. (Calculation: express the number in binary, and count the 1 bits).