Reply to post: Re: Blockchain tutorials

Blockchain study finds 0.00% success rate and vendors don't call back when asked for evidence

bpfh Bronze badge

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?

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon

Biting the hand that feeds IT © 1998–2019