Structured ambiguity · Equivocation

Ambiguity by design

Security here is not “hide the ciphertext harder.” It is keeping many secret hypotheses alive given the public transcript. Ambiguity is a feature, not a bug.

Jump to formal section

~7 min overview · ~5 min formalContinue: Twin circuits

When uniqueness is the enemy

In password world, enough observation uniquely determines the string. Here, the design keeps Eve unable to tell which secret (or which private map) produced the visible bearings. That leftover uncertainty is equivocation: many stories still fit the evidence.

Shannon’s unicity distance u asks when ciphertext collapses to one key. Authorization transcripts aim at the opposite: anti-unicity: more recordings that still leave the secret ambiguous (notation). Formal walkthrough: Why more data doesn't help.

Structured ambiguity: public transcript fails to collapse a cloud of still-plausible secret hypotheses — Many secrets still fit · non-unicity
After the public transcript arrives, the hypothesis cloud stays lit, many secrets still fit. Balanced zones, private map, and fresh rounds keep non-unicity intentional. Takeaway: structured ambiguity is a design goal so observation cannot pick the one true secret.

Mechanisms that preserve ambiguity (conceptual)

Structured ambiguity is the design pattern: balanced partitions, private bijections, session independence. Conceptual only: no manufacturing steps.

Balanced zones
No frequency lean. When every public symbol is about equally likely, letter-counting has no compass.
Private synonym / bearing map
The legend that turns secret knowledge into public bearings stays off-channel. Observers see labels, not the bijection.
Fresh geometry per session
New challenge layouts break cross-session stitching. Watching many logins does not assemble one unique map.
Membership-only outputs
The channel carries evidence of work, not an export of φ. Verifier twins resolve membership; Eve does not gain the secret.

Flat public symbols deepen at A flat, unreadable channel. Ceremony objects live under How Rosario works.

Ambiguity vs confusion (terminology)

Confusion (private map)

The sealed φ relationship scrambles which secret meaning maps to which public bearing. Eve lacks the legend.

Spreading across rounds

Fresh geometry and independent sessions spread evidence so archives do not stitch into one recoverable map. Think diffusion-like breadth, not a patent synonym dump.

Worked intuition

Two different secrets can produce bearing streams that look the same under the public view: same flat histogram, same challenge class, different private legends. Eve’s notebook fills with O; mutual information stays empty under the model. No production parameter set is claimed as a secret recipe here, only the information-flow idea.

What ambiguity does not forgive

Skewed partitions that lean frequency analysis back into the channel
Reused nonces that let yesterday’s transcript authorize tomorrow
Leaked φ: ambiguity ends when the legend is public
Side channels outside the model (timing, UX phishing, mis-issued twins)

Computational crypto often seeks unique decryption for legitimate holders. Authorization wants observer-side non-unicity. That is a job difference, not “better AES.” Compare the computational bargain with unicity distance. Attack families: Why classical attacks fail. Scope: Claims.

Formal mathematics and notation

Formal anti-unicity and equivocation

Shannon unicity distance asks when ciphertext collapses to one key. Authorization transcripts aim at the opposite: anti-unicity, more recordings that still leave the secret ambiguous. With hidden state X, observable O, and challenge C, the Channel Zero claim remains:

Ambiguity-preserving transcript

I(X;O\mid C)=0

Read as: Given the challenge, observing the transcript does not collapse uncertainty about the hidden state.

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: This is the formal condition that keeps many secret hypotheses alive even as public observations accumulate.

Computational contrast: Classical unicity relies on redundancy eventually collapsing ambiguity; this claim denies that collapse at the level of effective information.

References:Channel Zero Information-theoretic authorization

SAC: public scaffold

\mathcal{F}: I\times L\to V^d

Read as: The Structured Ambiguity Container publishes a scaffold F that maps each coordinate index and alphabet label to a d-dimensional payload vector.

Arguments

$I$: : index set of coordinates in the selector path
$L$: : label alphabet of size k per coordinate
$V^d$: : payload vector space for each scaffold cell

Operators

$\mathcal{F}$: : public structured-ambiguity scaffold map
$\to$: : maps each (index, label) pair to a public payload

Significance: Every path is visible in F; the private fact is which path σ the prover selected, not which cells exist.

Computational contrast: A ciphertext hides content; a SAC scaffold displays every candidate route while withholding the private selector.

References:New Dimensions PDF

SAC: induced section and path min-entropy

s_\sigma(i)=\mathcal{F}(i,\sigma(i)),\qquad H_\infty(\sigma\mid\mathcal{F})=n\log_2 k

Read as: The private path induces a section through the public scaffold, and in the idealized model the conditional min-entropy of that path given F is n log base 2 of k.

Arguments

$\sigma$: : private selector path through the public scaffold
$s_\sigma$: : induced section: the payloads along the chosen path
$n$: : number of coordinates in the path
$k$: : labels per coordinate (|L|)

Operators

$H_\infty$: : min-entropy of the path given the public scaffold
$\mid$: : conditioned on the published scaffold

Significance: Ambiguity is engineered: k^n equiconsistent paths remain when no visible marker singles out σ.

Computational contrast: Binding tag D may be computational; scaffold hiding is about the public distribution of F, not hash hardness.

References:Full SAC construction (PDF)

Codebook sheet as a carrier projection of the public structured-ambiguity scaffold — This carrier plate shows that a printed codebook sheet can instantiate the same abstract manifold when public labels remain accessible, witness elements stay detectable, and the private morphism remains concealed.
Read the sheet as a path-complete public scaffold, not a leaked map: every route is visible while σ stays private. Takeaway: security depends on carrier invariants, not on a single medium.

Every path is visible on the carrier; the private path is not marked. A printed codebook sheet can instantiate the same abstract manifold when labels stay public and σ stays concealed.

Equivocation stays positive when public marginals are flat and sessions independent (notation). Deepen: Why more data doesn't help. Scope: Claims. Full construction: New Dimensions PDF.

Concentric wheels depicting public foliation ceremony theory — Public foliation wheels
Read concentric wheels as public foliation layers around a private map that never enters the channel. Outer rings are challenge and witness structure; the core stays sealed. Takeaway: ceremony geometry is public while membership knowledge stays local.