Channel Zero · Empty public transcript

When the channel reveals nothing

Channel Zero names an authorization transcript where, given the public challenge, the observable channel carries no secret-relevant information under the model. Recording the ceremony is not learning the secret.

Jump to formal section

~7 min overview · ~5 min formalContinue: Perfect secrecy

The empty channel

Imagine a public bulletin board. Everyone can see what gets pinned. Still, nothing pinned should let an observer reconstruct the private map that only the rightful prover holds. The channel can be fully recorded and remain empty of secret-relevant information.

Computational crypto can hide meaning from bounded attackers. Channel Zero aims for structural absence of secret information in the public transcript under the model, even against unbounded compute. That is information-theoretic authorization, not “TLS but louder.”

Channel Zero bulletin board: public challenge and witnesses recorded while hidden state stays locked with I(X;O|C)=0 — Record the channel · learn nothing about the secret
The plate shows a public bulletin board of challenges and witnesses beside a locked vault for hidden state. An eavesdropper can fill a notebook with surface bits while mutual information about the secret stays zero under the model. Takeaway: record the channel, learn nothing about the secret.

Eavesdropper notebook (micro-example)

Picture an eavesdropper with a notebook open beside the bulletin board. Every public challenge, every bearing witness, every allow/deny residue gets written down, page after page. Under a Channel Zero design, that notebook is busy with surface bits and still useless as a map to the secret.

What fills the notebook

Public challenge leaves and selectors
Uniform-looking bearing symbols
Session residue and verdicts

What the notebook does not yield

The private map φ
The hidden secret state itself
A reusable credential from the archive

Frequency counting fails when public symbols are about equally likely. The notebook grows; belief about the secret does not. That is the picture behind empty-channel authorization, formalized below.

Hidden state vs public transcript

Stays off-channel

Private map φ
Key material and entropy anchors
The hidden secret state itself

May appear on the channel

Public challenge
Bearing witnesses
Verdict residue / allow–deny outcomes

Objects only, no manufacturing steps. Method detail lives under How Rosario works.

Uniform bearings (why frequency fails)

Uniform bearings make public symbols about equally likely. Classical letter-counting fails when marginals are flat. Surface entropy can be nonzero, the channel looks busy, while effective mutual information with the secret stays zero under the model. That gap is the observer's ledger story; formal budgets live at What observers can measure.

Surface bits versus effective bits with observer independence — Observer sees bits, not knowledge
Compare surface bits the observer can record with effective bits about the secret. Independence of the observer from the hidden map keeps I_effective empty even when the notebook is full. Takeaway: seeing the transcript is not learning the secret.

Freshness and burn

Emptiness of mutual information does not alone kill replay. Session binding and burn-before-validate do: the nonce is spent on the ledger before validation finishes. Channel language stays; systems language deepens on Security and Why classical attacks fail.

Observer captures transcript bits while hidden knowledge remains zero — Capture is not knowledge
Follow the observer path: a full transcript fills the notebook while the vault for the secret stays closed. Surface bits are recordable; effective mutual information with the secret stays empty under the model. Takeaway: capture of the channel is not knowledge of the secret.

Formal mathematics and notation

Formal claim

Let X be the hidden secret state, O the observable public transcript, and C the public challenge. The Channel Zero claim is zero mutual information about the secret given the challenge:

Channel Zero leakage

I(X;O\mid C)=0

Read as: Given challenge C, the observed public channel O reveals no mutual information about hidden state X.

Arguments

$X$: : hidden secret state: map, selector path, and local authorization knowledge
$O$: : observable public channel transcript
$C$: : public challenge context

Operators

$I$: : mutual information with the hidden state
$\mid$: : conditioning on the challenge
$= 0$: : zero effective leakage from the channel

Significance: This is the page's formal definition of an empty authorization channel.

Computational contrast: Channel Zero is not a claim that a ciphertext is too expensive to decrypt; it is a claim that the observed ceremony carries no secret-relevant information.

References:Channel Zero Information-theoretic authorization

Uniform bearing marginal

P(W=w\mid C)=1/|B|

Read as: For a fixed challenge, each public bearing symbol is equally likely.

Arguments

$W$: : public bearing witness emitted on the channel
$w$: : one bearing value an observer can count
$B$: : bearing alphabet, such as the six public directions
$C$: : challenge context for the distribution

Operators

$P$: : probability of the observable bearing
$\mid$: : conditioned on challenge C
$1/|B|$: : uniform probability across the bearing set

Significance: The flat marginal explains why frequency counting fails before the stronger mutual-information claim is applied.

Computational contrast: A computational credential can leak biased residue and still rely on hardness; Channel Zero aims to remove the statistical compass itself.

References:Synonym-channel uniformity Uniform channel

Same Shannon spirit as one-time-pad message secrecy $I(M;C)=0$ , different job: authorization emptiness, not OTP logistics for every message byte. Full symbol table: notation. Model scope: Claims.

Formal path

Deepen in Math order: