Technology · Four doors

Technology

Technology covers a security-class shift: today’s web mostly bets on hard math that expires; a different proof class aims for public transcripts that carry no secret-relevant information under stated axioms.

Jump to formal section

~8 min overview · ~6 min formalContinue: Channel Zero

Two kinds of security

Math hub →

For fifty years the internet has mostly bet that certain math problems stay hard. That bet powers TLS, tokens, and the padlock feeling in the browser, but stolen credentials still authorize because possession travels with the secret. ENI6MA is not a stronger padlock. It is a different claim class: Channel Zero and Rosario-style proofs aim so observers can record the public ceremony and still learn nothing usable about the secret.

Two roads of security: computational hardness clock versus empty-channel authorization with I(X;O|C)=0 — Two roads of security · not a stronger lock
Read left-to-right: the computational road treats secrecy as a hardness clock (TLS/PKI-style). The information-theoretic road treats authorization as an empty public channel: recording the transcript does not yield the secret. Takeaway: ENI6MA argues a different job, not a stronger lock on the same road.

Call the first road the computational bargain: security that assumes attackers are too slow to break the math. RSA, elliptic curves, and lattice schemes all live here. When machines get faster, algorithms improve, or an archive waits long enough, the bet can expire, and a stolen key still authorizes until someone revokes it.

Call the second information-theoretic authorization: security that does not rely on computers being too slow. It asks whether the public channel even carries secret-relevant information. If the transcript is empty of that information under the model, recording it is not learning the secret. Two roads. One is a hardness clock. The other is an empty channel.

Computational security versus information-theoretic authorization for authorization transcripts
Dimension	Computational security	Information-theoretic authorization
Core bet	Hard problems stay hard (RSA, ECC, lattices…)	Public transcript reveals nothing usable about the secret
Expires when	Machines, algorithms, or archives catch up	Model assumptions fail, not a faster CPU alone
Formal flavor	Hardness / IND-CPA-style games; key lifetimes; “padlock” metaphors	Mutual information, unicity, empty-channel claims under named axioms
If the archive is stolen	Steal key → keep authority (until revoked)	Capture ≠ knowledge under the perfect-secrecy claim for that channel

Deepen next: Today's crypto: a bet on hard math · Perfect secrecy (Shannon) · Math hub.

Kill the key. Long live the proof.

This isn't a stronger lock. It's a new order of trust.

For fifty years the internet has guarded secrets (passwords, tokens, certificates) and watched them get stolen. ENI6MA ends the reign of the stored secret: every message from every person, app, and AI proves itself with knowledge, once, and the proof dies with the moment. Nothing to steal. Nothing to replay. Nothing to breach.

One-shot, request-bound proofs mean authority expires with the request. Replay has nowhere to go when burn-before-validate is enforced: the nonce is spent on the ledger before validation finishes. That is the product claim in one line: ENI6MA replaces reusable credentials with one-shot, request-bound proofs, so a stolen secret is not a stolen capability.

Split diagram: stored secret equals authority versus one-shot envelope that dies after accept — Stored secret vs one-shot proof
Read left-to-right: the stored-secret column shows ambient credentials that keep working after copy; the one-shot column shows a request-bound envelope that burns after accept. Takeaway: stolen possession is not lasting authority when the proof dies with the moment.

Where it ships in the estate is a Security and Products story. Security architecture covers gate order and coexistence; Technology states why the claim class differs.

Four doors into Technology

Nested navigation mirrors these four headers. Each door has a job statement and a primary CTA; start there, then follow the reading path if you want the full spine.

Fundamentals

Why proofs differ; the computational bet; the empty channel; recording without learning; and reading paths so you never start in the wrong chapter.

Why not all proofs are equal →

Proofs

How Rosario works in practice; ambiguity by design; twin-circuit identity; human ceremonies; and why classical attacks miss this model.

How Rosario works →

Math

Shannon perfect secrecy, uniform channels, observer bit budgets, unicity, axioms, quantum bounds, and a comparison matrix: formal case first.

Math hub →

Reference

Papers, glossary and notation, model-scoped claims, and the engineering stack that connects theory to products, without burying the Fundamentals pages.

Research papers →

Suggested starts

I buy security products

I build systems

I check proofs

Prefer a guided sequence? Where to start.

Where it ships

Foundry mints identity into circuits. Control registers, ledgers, and observes. Gate enforces at the boundary. Verify attacks your deployment the way an adversary would. That product plane is documented under Products and Security. Technology states why; Products and Security cover how it runs. Engineering stack detail for implementers lives at Engineering stack, not on this hub.

Formal mathematics and notation

Formal two-roads (Shannon framing)

Computational security is usually stated as a hardness game: a bounded adversary fails except with negligible probability. Information-theoretic authorization for Channel Zero is stated as emptiness of mutual information on the public ceremony channel. Notation lives in the notation table.

Message perfect secrecy (Shannon spirit)

I(M;C)=0

Read as: The ciphertext carries zero mutual information about the message.

Arguments

$M$: : message or protected value before observation
$C$: : ciphertext in the Shannon secrecy equation

Operators

$I$: : mutual information
$= 0$: : posterior belief does not change after observing ciphertext

Significance: It states the classical emptiness claim: ciphertext observation does not update beliefs about the message.

Computational contrast: The computational bargain replaces this emptiness requirement with a hardness clock so strangers can talk at scale without OTP logistics.

References:Perfect secrecy (Shannon)

Authorization empty channel (Channel Zero)

I(X;O\mid C)=0

Read as: Given challenge C, observable transcript O reveals no mutual information about hidden state X.

Arguments

$X$: : hidden state: private map, secret choice, key material, or local ceremony state
$O$: : observable public transcript or archive
$C$: : public challenge or context conditioning the observation

Operators

$I$: : mutual information between hidden state and observation
$\mid$: : conditioning on the public challenge
$= 0$: : zero effective leakage under the stated model

Significance: Same Shannon spirit as OTP message secrecy; different job: authorization emptiness on the public ceremony channel.

Computational contrast: Hardness games ask whether a bounded adversary can forge or decrypt; this equation asks whether the transcript carries secret-relevant information at all.

References:When the channel reveals nothing Claims