Twin circuits · Compiled identity

Identity in twin circuits

Identity here is not a row in a password database. It is a pair of compiled twins that share a sealed private relationship and can verify membership work per event, without putting the private map on the channel.

Jump to formal section

~6 min overview · ~4 min formalContinue: Human ceremony proofs

Why “twin”

Two matched instruments, like tuning forks: only the matching pair rings true for a given ceremony. Cloning a bearer token is easy. Forging the twin relationship without the sealed morphism is not the same game.

A compiled twin is one half of the twin-circuits pair (prover side and verifier side) bound by a private relationship that never rides the public channel. Per-event work checks membership; it does not dump a binary layout recipe.

Matched prover and verifier twin circuits sharing a sealed private map while the public channel carries only witnesses — Matched pair · sealed map · per-event work
Mirror the prover and verifier twins: they share a sealed private map relationship that never rides the public channel. Only witnesses and challenges travel between them. Takeaway: identity lives in matched circuits and per-event work, not in a reusable ambient secret.

What is compiled vs what is fresh

Compiled

Identity relationship / map commitment
Sealed φ held off-channel
Matched prover / verifier circuit pair

Fresh each event

Entropy and freshness epoch
Challenge geometry C
Bearing witnesses and spent nonce

Per-event work is the unit of authority: membership labor for one freshness window. Ceremony overview: How Rosario works. Empty-channel goal: When the channel reveals nothing (notation).

Revocation and cohort thinking

Revoke by registry state, not by chasing leaked passwords across the internet. When a twin pair is retired, new events fail closed. Product Control is where that ships; this page stays mechanism-level.

Ships links: Foundry (mint / compile circuits) · Control (registry / revocation) · Security.

Human and machine twins

Same primitive family; modality differs. Humans use ceremony UX: recognize and choose under a fresh layout. Agents use bearing streams and compiled envelopes. Both aim at an empty authorization channel. Human path: Human ceremony proofs. Papers entry for agent framing: Agentic AI systems.

ITS authorization vs sealing crypto

Twins enable the empty-channel authorization story. Compilation and storage still use standard engineering crypto for sealing integrity. Keep the class distinction clear: channel emptiness is not “AES but louder.”

What twins are not

Not a stored API key with a fancy name
Not biometric templates on a server
Not ambient certificates that authorize forever until expiry
Not a guarantee of accept/reject rates without parameters and axioms

Engineering detail and binaries: Engineering stack. Demo UIs may be visual-only: shipping proofs use compiled twins.

Formal mathematics and notation

Formal twin relationship

Compiled twins share a sealed private morphism φ held off-channel. Per-event work checks membership against a fresh challenge C; bearings witness the work without exporting φ. Authorization emptiness target:

Twin-circuit authorization emptiness

I(X;O\mid C)=0

Read as: Given challenge C, the public transcript O of twin-circuit work reveals no mutual information about hidden twin state X.

Arguments

$X$: : sealed twin relationship, private maps, and local membership state
$O$: : compiled-artifact interactions and public transcript visible off-channel
$C$: : fresh challenge checked by the compiled twins
$\phi$: : private map shared by the twin relationship, not exported as a credential

Operators

$I$: : mutual information
$\mid$: : conditioned on the public challenge
$= 0$: : no effective leakage from the public transcript

Significance: It states why two compiled artifacts can verify membership without making the visible exchange into a reusable credential.

Computational contrast: The twin-circuit claim is not that compiled binaries are hard to reverse forever; it is that the authorization transcript does not disclose the private relationship.

References:Channel Zero How Rosario works

Symbol table: notation. Method: How Rosario works. Scope: Claims.

Foundry, Control, Gate, and Verify stacked authorization planes — Four authorization planes
Read top-to-bottom through Foundry (mint twins), Control (registry and ledger), Gate (request boundary), and Verify (adversary harness). Each band is a different ops job that ships the same proof family. Takeaway: the product stack separates integrity tooling from the empty-channel authorization thesis.