White paper WP-011
Merkle Tree Audit Architecture for AI Decision Systems
An append-only tree beats a database table nobody trusts.
At a glance
- Paper
- WP-011
- Topic
- Merkle Tree Audit Architecture for AI Decision Systems
- Format
- PDF + web summary
- Signatures
- ML-DSA-65 post-quantum (NIST FIPS 204)
- Sandbox
- Reproducible at affix-io.com/sandbox
- Company
- AffixIO, Wales, UK
Merkle Tree Audit Architecture for AI Decision Systems is an AffixIO technical paper. An append-only tree beats a database table nobody trusts.
If your audit root can be edited, your audit story is optional. We document AffixIO's sorted-pair SHA-256 Merkle tree: append-only roots, inclusion proofs, and ML-DSA-signed anchors that third parties verify offline.
Summary
If your audit root can be edited, your audit story is optional. We document AffixIO's sorted-pair SHA-256 Merkle tree: append-only roots, inclusion proofs, and ML-DSA-signed anchors that third parties verify offline.
Download the full PDF for technical detail, diagrams, and reproduction steps. Public sandbox: affix-io.com/sandbox.
Related reading
Frequently asked questions
Why sorted-pair Merkle hashing?
Lexicographic ordering removes ambiguity in parent hash computation and matches Certificate Transparency practice.
What does an inclusion proof contain?
The leaf hash, sibling path, and signed root let verifiers recompute the root without AffixIO infrastructure access.
How often are roots signed?
After each batch of proof insertions, with roots published to an append-only log.