It uses a Merkle Tree structure to "seal" log batches. The core value-add is the "Strict Mode" verification: it doesn't just return a boolean, but traverses the tree to identify the exact index of the compromised log entry in O(N *log N) time.
Key Technical Highlights:
- Deterministic Canonicalization: Ensures that JSON/Dict entries produce identical hashes regardless of key ordering.
- Granular Diagnostics: Pinpoint specific tampered leaves without re-hashing the entire historical log.
- Lightweight & FOSS: Zero-dependency Python implementation designed for easy integration.I’m looking for feedback on the tree traversal logic and whether this approach satisfies real-world compliance (SOC2/HIPAA) requirements.
I'd love to hear your thoughts or "roasts" on the implementation!