A Hash Tree Proves Nothing Was Changed. It Does Not Prove Anything Was True.

What the structure buys

Hash every item. Hash the hashes in pairs. Keep going until one value at the top stands for the whole set.

Two properties follow, and they are worth having. Changing any item changes the top value, so tampering is detectable without re-reading everything. And membership can be proved with a short path rather than the whole set, so a verifier checking one item downloads a handful of hashes instead of a database.

This is the structure underneath most chains, most transparency logs and most of what people mean by "tamper-evident."

The claim it does not support

A root commits to what was written. It says nothing about whether what was written was true.

A perfectly formed tree over fabricated records produces a perfectly valid root, and every inclusion proof against it verifies. The mathematics is working exactly as designed while the content is worthless.

So "anchored on a blockchain" is a claim about integrity, not about accuracy, and the two get sold as one constantly. The honest phrasing is that the structure tells you the record has not changed since it was committed, and the question of whether it should have been committed is entirely outside it.

That distinction is the one to carry into any vendor conversation, including ours.

What the scar is actually evidence of

Not that we write flawless systems. We plainly did not.

It is evidence of what happens to a defect after it is found. It got measured and fixed, and then the account of it was written into the source where the next person to touch that code will read it, rather than quietly patched and forgotten.

A vendor with no visible scars has either had none or shown you none, and after enough systems you learn which is more likely. We would rather hand you ours than have you find it.

What to ask any vendor about anchoring

"What does your root commit to, and what does it not?" If the answer slides from integrity to accuracy, stop there. Ours commits to what was written.

"Show me a defect you found in this layer and what you did about it." The answer tells you more about the engineering than any architecture diagram. Ours is above and it is in the public source.

"Has the storage layer been independently reviewed?" For us: no. Storage bugs are quiet, and this one only became visible as disk growth.

"Can I verify a proof without asking you?" If verification requires the vendor's cooperation, the structure is decorative.

Where this leaves a decision

If you need audited state infrastructure, ours has not been reviewed, and a standard structure implemented by an unreviewed team is exactly the risk this page is describing.

If what you need is a record that cannot be quietly edited after the fact, that property is real and it is what runs today, provided you keep hold of the distinction this page opened with: it proves nothing was changed, not that anything was true.

Keep reading

A Hash Tree Proves Nothing Was Changed. It Does Not Prove Anything Was True. · Solidus