No H33 code required. Only the specification and test vectors. Byte-identical outputs prove protocol compatibility. Successful implementations receive official listing in the HATS Compatibility Matrix.
Each test vector specifies inputs, deterministic processing rules, and expected outputs. Your implementation must produce byte-identical results.
Success criterion: byte-identical hash outputs for all 26 vectors.
The specification defines everything needed. The reference implementation is proof that it works, not a dependency.
147 requirements defining graph structure, verification rules, replay semantics, and error classification.
Section 5 of the specification. Deterministic byte ordering for all hashed structures.
26 bundles with expected outputs. JSON format. Machine-readable inputs and expected results.
The specification defines everything needed. The reference implementation is proof that it works, not a dependency.
Implementations that pass all 26 vectors receive official listing.
| Implementation | Language | Vector Set | Vectors | Status |
|---|---|---|---|---|
| H33 Reference | Rust | v1 | 26/26 | PASS |
| (Your implementation) | Any | v1 | ?/26 | — |
Contact standard@h33.ai to register your implementation and get listed.
Four steps from download to official listing.
Source code submission is optional. Only the test results are required for listing.
Download the canonical test vectors. Build your own verifier. Prove protocol compatibility.