PricingDemo
Log InGet API Key
H33-74 AI Attestation

Every AI Decision. Attested. Verifiable. Permanent.

Every AI inference produces a 74-byte post-quantum attestation. Three independent signature families. Hash-chained into a tamper-evident sequence. Independently verifiable by any party without vendor access or API keys.

Not "we logged it." Cryptographically signed. Mathematically bound. Court-admissible.

See Attestation Live How It Works
74B
Per attestation footprint
3
PQ signature families
42µs
Attestation latency
30yr+
Post-quantum proof validity
The Problem

AI decisions happen millions of times a day. None of them are provable.

Logs tell you what someone claims happened. Attestations prove what actually happened. The gap between these two is where liability, fraud, and regulatory failure live.

📝

Logs Are Mutable

Application logs can be edited, deleted, or corrupted by anyone with admin access. A breach destroys the evidence. A malicious insider rewrites the record. In litigation, unsigned logs are hearsay — not evidence.

🔒

Vendor Trust Is Not Proof

"Our systems show..." is a trust claim, not a mathematical proof. Regulators are moving from trust-based to evidence-based compliance. If your AI vendor says the decision was compliant, you are trusting their word — not verifying it.

Signatures Expire

RSA and ECC signatures will be forgeable by quantum computers. An AI audit trail signed today with RSA-2048 may be worthless in court by 2035. Post-quantum signatures are the only way to future-proof AI decision records.

Comparison

Logs vs. cryptographic attestation

One is a claim. The other is proof.

Traditional Logging
AI decision made
Log entry written to database
Admin has write access
Breach destroys evidence
"We believe this happened"
  • Mutable — any admin can edit
  • Vendor-controlled — requires trust
  • No independent verification possible
  • Quantum-vulnerable signatures
  • Not admissible as independent evidence
H33-74 Attestation
AI decision made
SHA3-256 hash of inputs + outputs
3 PQ signatures (ML-DSA, FALCON, SLH-DSA)
Hash-chain to previous attestation
"Here is the proof. Verify it yourself."
  • Immutable — cryptographically bound
  • Independently verifiable — no vendor access
  • Any party can verify with public data
  • Post-quantum secure for 30+ years
  • Admissible as mathematical evidence
How It Works

From AI inference to permanent proof in 42 microseconds

Every AI decision triggers a five-step attestation pipeline. The output is a 74-byte proof that any party can independently verify.

Step 01
Capture
Inference inputs, outputs, model version, authority chain, and timestamp are captured at the decision boundary.
<1µs
Step 02
Hash
SHA3-256 digest binds all five elements into a single 32-byte commitment. Tamper-evident by construction.
<1µs
Step 03
Sign
Three independent PQ signature families sign the hash: ML-DSA (lattice), FALCON (NTRU lattice), SLH-DSA (stateless hash). Breaks iff all three hardness assumptions fail simultaneously.
~35µs
Step 04
Chain
The attestation is hash-chained to the previous one via SHA3-256. Any gap or alteration in the sequence is immediately detectable.
<1µs
Step 05
Store
32 bytes on-chain. 42 bytes in Cachee for the full audit trail. Total: 74 bytes per AI decision. Permanent.
~5µs
Attestation Anatomy

What gets attested in every AI decision

Five elements are cryptographically bound into every 74-byte attestation. Missing any one of them means the proof is incomplete. H33 captures all five by default.

Three Signature Families

ML
ML-DSA (Dilithium)
NIST FIPS 204. Lattice-based. Module Learning With Errors hardness assumption. The primary signature in the H33-74 bundle.
FK
FALCON
NTRU lattice-based. Independent hardness assumption from ML-DSA. Compact signatures for bandwidth-constrained verification.
SH
SLH-DSA (SPHINCS+)
NIST FIPS 205. Stateless hash-based. Zero algebraic structure. The mathematical backstop — secure even if lattice assumptions fall.
The attestation is invalid unless all three signatures verify. An attacker must break MLWE lattices, NTRU lattices, AND stateless hash functions simultaneously — three independent mathematical bets.
Verification

Anyone can verify. No vendor access needed.

H33 attestations are independently verifiable by design. No API key, no vendor relationship, no trust assumption. The proof speaks for itself.

🔍

Auditor Verification

An auditor receives the 74-byte attestation, checks the three PQ signatures against public keys, verifies the SHA3-256 hash chain, and confirms the on-chain anchor. No access to your systems required.

Legal / Court Verification

In litigation, the attestation is mathematical evidence that a specific AI decision occurred with specific inputs at a specific time. It cannot be forged, backdated, or altered. Any expert witness can independently verify it.

🏢

Counterparty Verification

Business partners, regulators, or customers can verify any AI decision attestation without contacting H33 or accessing your infrastructure. Send the 74-byte proof. They verify it independently.

🔗

Chain Integrity Check

Every attestation is hash-chained to the previous one. Verifying any single attestation also validates its position in the sequence. A gap or alteration anywhere in the chain is immediately detectable.

On-Chain Anchor

The 32-byte on-chain hash provides an immutable public timestamp. Even if every other system is compromised, the on-chain record proves the attestation existed at that point in time.

💾

Cachee Audit Trail

The full attestation details — all five attested elements plus the three signatures — are stored on Cachee.ai for instant retrieval. Post-quantum attested storage with sub-microsecond lookup.

Attestation adds less than 0.1% overhead to any AI inference.

42µs
Per-decision attestation
74B
Total proof size
0
Vendor trust required
Integration

Attest any AI decision. Verify it anywhere.

Two API calls. One to attest. One to verify. No SDK required.

attestation.py
# Attest an AI decision
attestation = h33.attest(
    inputs=inference_request,
    outputs=model_response,
    model_version="gpt-4-0125",
    authority=delegation_chain
)

# attestation.proof   — 74-byte H33-74 attestation
# attestation.hash    — SHA3-256 commitment (32 bytes on-chain)
# attestation.chain   — hash-chain position in sequence

# Verify (any party, no API key needed)
result = h33.verify(attestation.proof)
# result.valid         — True
# result.signatures    — {ml_dsa: valid, falcon: valid, slh_dsa: valid}
# result.chain_intact  — True
FAQ

Frequently asked questions about AI attestation

What is AI attestation?

AI attestation is a cryptographic proof that a specific AI decision occurred with specific inputs, produced specific outputs, used a specific model version, and was authorized by a specific authority chain. Unlike logging, attestation is immutable, independently verifiable, and signed with post-quantum signatures that cannot be forged by either classical or quantum computers.

Why can't I just use application logs?

Logs are mutable, vendor-controlled, and unsigned. Any administrator can edit or delete them. A breach can destroy the entire log history. In court or regulatory proceedings, unsigned logs are assertions — not evidence. Cryptographic attestation produces a mathematical proof that cannot be altered after the fact and can be independently verified by any party without accessing your systems.

What does 74 bytes mean?

Every AI decision attestation is compressed to exactly 74 bytes: 32 bytes stored on-chain (the SHA3-256 hash commitment) and 42 bytes stored in Cachee (the compressed three-family PQ signature bundle). This is the result of H33-74 compression — three full post-quantum signatures distilled into 74 bytes while maintaining independent verifiability. Patent pending.

Can I verify an attestation without contacting H33?

Yes. That is the entire point. Verification requires no API key, no vendor relationship, and no trust in H33. The 74-byte attestation contains everything needed for independent verification: the hash commitment can be checked against the on-chain record, and the three PQ signatures can be verified against public keys. Any party — auditor, regulator, opposing counsel, business partner — can verify independently.

What is hash chaining?

Each attestation includes the SHA3-256 hash of the previous attestation in the sequence. This creates a tamper-evident chain: altering or removing any attestation breaks the hash chain from that point forward. Inserting a fake attestation is impossible without knowing the hash of the attestation that precedes it. This provides sequence integrity in addition to individual attestation integrity.

What is the performance overhead?

Approximately 42 microseconds per AI decision. For a typical LLM inference of 50–500 milliseconds, this is less than 0.1% overhead. Batch attestation (via H33-74 Claims 124–125) amortizes the Dilithium signature across 32 decisions via batched Merkle response attestation, further reducing per-decision cost. The attestation pipeline runs asynchronously and never blocks the inference response.

See attestation in action

Make an AI decision. Get a 74-byte proof. Verify it independently. No commitment required.

Try the Live Demo Schedule a Demo