PricingDemo
Log InGet API Key
Protocol Infrastructure — Frozen v1.0

Deterministic Verification.
Frozen Semantics.
Independent Replay.

H33 protocols are built for long-term cryptographic reproducibility. Verifier outputs, replay integrity classifications, rejection semantics, domain separators, and compatibility rules are frozen and regression-tested against canonical conformance vectors.

147
Requirements
26
Test Vectors
26
Error Codes
7
Proof Profiles
Protocol Freeze

What "Frozen" Means

Protocol freeze is a binding commitment. Frozen surfaces cannot change without a major version increment, a migration guide, and a minimum 12-month overlap window.

Frozen SurfaceDescription
Verifier SchemasInput/output shapes, field names, types, and ordering for all verifier endpoints
Proof ProfilesThe 7 canonical proof profile definitions and their parameter envelopes
Replay Integrity SemanticsClassification logic, grading thresholds, and replay integrity labels
Error NamespacesAll 26 HATS_ERR codes, their severity levels, and requirement references
Deterministic OrderingField serialization order in transcripts and canonical encodings
Domain SeparatorsAll context strings used in hash derivation and transcript binding
Canonical EncodingsByte-level encoding rules for proofs, signatures, and attestation bundles
Transcript SemanticsTranscript derivation logic, append ordering, and finalization rules

Protocol drift immediately breaks CI through canonical freeze vectors and regression corpora.

Replay-Grade Verification

Deterministic Replay

The same proof always produces identical transcript derivation, identical replay classification, identical rejection semantics, identical verifier outputs. Across implementations. Across languages. Forever.

Deterministic Failure

Structured Rejection Semantics

Malformed governance does not merely fail. It fails deterministically with stable error codes, severity classification, requirement references, and replay integrity grading.

{
  "error": "HATS_ERR_POLICY_EXPIRED",
  "severity": "critical",
  "requirement": "REQ-1.3",
  "replay_integrity": "deterministic",
  "message": "Governing policy version 4 expired at 2026-05-01T00:00:00Z",
  "resolution": "Activate policy version 5 or later",
  "verifier_output": {
    "transcript_hash": "a3f8c1...",
    "rejection_class": "policy_violation",
    "deterministic": true
  }
}
Compatibility

What Can and Cannot Change

Protocol evolution follows strict compatibility rules. Some changes are safe within a minor version. Others require a breaking version increment.

Surfacev1.x Status
Field additionsAllowed
Field removalsBreaking (v2 required)
Error code renameForbidden
Severity reclassificationForbidden
Requirement ID reuseForbidden
Domain separator mutationForbidden
Proof profile additionsAllowed
Replay integrity reorderingBreaking (v2 required)
New test vectorsAllowed
Existing vector modificationBreaking (v2 required)
Ecosystem

Independent Implementations Welcome

Third-party implementations can validate protocol equivalence without trusting H33 infrastructure.

ImplementationLanguageVectors PassingStatus
H33 ReferenceRust26/26Conformant
Your implementationRegister below

Contact standard@h33.ai to register your implementation.

Verification

Machine-Testable Conformance

HATS compatibility is not a claim. It is a test result. 26 canonical vectors. Byte-identical expected outputs. Any language.

$ hats-verify conformance path/to/vectors/

Rust-native cryptography. Language-neutral verification.

H33's STARK engine runs in pure Rust. The cryptographic hot path does not depend on JavaScript or browser runtimes. No scripting layer participates in proving, verification, transcript construction, field arithmetic, challenge derivation, or security-critical execution.

Portable JSON test vectors allow independent verifiers in Go, TypeScript, Python, Java, or Rust to reproduce identical outputs. The proving and verification path is fully deterministic and backed by 524+ passing tests plus 26 canonical conformance vectors for third-party reimplementation.

Verify the Protocol Yourself

Download the canonical test vectors. Run the reference verifier. Or build your own. The protocol is the proof.

Download Test Vectors Read the Specification