Re: Blockchain tutorials
A linked tree. Sounds a bit like FAT. You can verify the integrity of the tree... but nothing is stopping you from dropping older segments. They will clearly be corrupt if a scan and calculation of the whole tree is made, but how often would that happen?
Using the anology of the File Allocations Table, you would only find corruption when you accessed the data and found that pointers to the data were missing or invalid... or when you ran chkdsk, which was not a daily occurrence... now on a distributed file several gig long, I don’t see a sanity check of the entire chain happening on a regular basis either, or have I missed something?