From the moment data is created to the moment it is verified — every step is sealed, structured, and cryptographically attested. No trust required.
Something happens.
Each capability is independently useful. Together they form the first system where truth at creation survives through computation, attestation, and verification — without ever requiring trust.
Data never exists as plaintext outside the hardware-attested generation boundary. Encrypted at creation. No plaintext emitted.
Compute role vs verify role, structurally separated. Possession of one key hierarchy does not confer access to the other.
Origin cryptographically bound at the moment of generation, before any processing, transmission, or storage occurs.
Typed claims with semantic class (Fact, Event, Control, State), subject scope, issuability profile. 202-byte fixed serialization.
Positively assert what was checked and found absent. Distinguishes "checked and not found" from "not checked." No other framework does this.
Append-only, PQ-attested. Claims interpreted against the schema in effect at issuance time. Prevents retroactive reinterpretation.
7 typed relations: References, Supersedes, Corrects, Retracts, DerivesFrom, Aggregates, ScopesToFragmentRoot. Original preserved in the verifiable record.
Merkle tree over artifact fragments with domain-separated leaf/node prefixes. Claims can target specific fragments of a document, not just the whole.
Compute SHA3-256 on encrypted data without decrypting. XOR = ciphertext addition (free). AND = programmable bootstrapping. Result threshold-decrypted. Data bits never exposed.
What was planned vs what actually happened, committed independently. Divergence between dispatch and execution is itself detectable and verifiable.
Customer-trained FHE classifier. Customers define taxonomy, train model on their data. H33 runs encrypted inference, emits policy tags. Three confidence modes: hard classification, threshold proof, customer-decrypted. Human override and feedback loop for retraining.
4-state machine: Valid, Invalid, Expired, Contested. Contested is a first-class terminal state, not forcibly resolved. Two conforming verifiers given identical inputs produce identical state.
Each node is an H33-74 commitment. Each edge references prior node's execution_root. Cross-party verification without accessing other parties' systems.
Amendment, Reversal, Disputed, SettledDispute. Disputed nodes suspend downstream processing. All corrections are themselves PQ-attested.
30+ year custody chains. Periodic on-chain balance verification. Discrepancies auto-generate DISPUTED claims. Fully reconstructable from blockchain + attestation primitives.
ZK-STARK proof (no trusted setup) proving: valid instrument, not previously redeemed, not disputed, past maturity, authorized holder. Reveals only instrument ID and redemption amount. Not holder identity.
Proof, not trust. Every capability produces independently verifiable output. No capability requires access to another party's internal systems. No capability requires trust in H33.
H33 does not use a general-purpose LLM to read customer documents. Customers define the taxonomy. H33 converts documents into encrypted feature vectors, evaluates a compact customer-specific classifier under FHE, and emits policy tags.
No score. No probability. A binary, attested tag. The system never sees the document.
TFHE proves the classification score exceeded the threshold. The score itself is never revealed.
The encrypted feature vector is returned to the customer. Only the customer's key can decrypt. H33 never holds the result.
Bond trade lifecycle — five parties, one chain of proof.
Creates trade record
SignedValidates trade
SealedClears trade
AttestedSettles trade
VerifiedZK proof of valid claim
ProvenFull chain proven. No trust required. Each party verifies its node and adjacent nodes without accessing the full workflow or any other party's internal systems.
What others do vs. what Upstream does.