Technical Summary: Choric Masking in Ambient Release Systems

Problem Statement

The paper addresses the gap between formal non-observation and practical readability in public systems. Many systems require a hidden coordinate (a "protected locus," such as a role, affiliation, or condition) to remain unobserved while the system performs a visible sequence of actions (entering, waiting, correcting, forwarding). While the protected coordinate is not explicitly printed on the public surface, statistical traces—created by timing, repetition, hesitation, routing, role mismatches, and audience attention—can render the hidden locus readable.

The core problem is to determine whether two hidden loci induce trace laws that are indistinguishable to an audience with a finite set of tests, a bounded attention budget, and potentially adaptive response policies. The paper argues that traditional cryptographic indistinguishability (based on protocol transcripts) and differential privacy (based on database curators) are insufficient for "ambient release systems," where the channel of concern is the public choreography itself.

Methodology

The authors develop a finite trace calculus grounded in convex geometry and finite probability theory. The methodology rests on the following pillars:

1. Finite Staged Environments: The system is modeled as a tuple containing hidden loci ($\Theta$), visible roles ($R$), a state space ($S$), actions ($A$), observations ($Y$), and a norm gate ($N$) that dictates admissible actions for a role at a given history.
2. Trace Polytopes: For a fixed horizon $T$, the set of all admissible public traces induced by a hidden locus forms a convex polytope (the choric hull). This hull represents the "chorus" of admissible behaviors available to mask a specific locus.
3. Audience as Measurement Operators: An audience is defined not as an omniscient observer but as a class of bounded tests ($F_T$) applied to the trace. The security of a system is measured by the distance between the projected polytopes of two loci under these tests.
4. Attention Lenses: The model incorporates attention lenses (Markov kernels) that thin the trace before it reaches the observer (e.g., via gaze limits, dwell time, or memory compression). This is treated as a kernel enlargement problem where residues may vanish in the projected space even if present in the full trace.
5. Debt and Pressure Dynamics: For repeated interactions, the paper introduces a choric risk debt variable. This tracks unresolved residue that fails to be localized. The model analyzes how this debt drives "breadth" (selection of more candidates) and "dilution" (reduced attention per candidate) without necessarily increasing the hazard to the original carrier.

Key Contributions

1. Choric Masking and Non-Singularity

The paper defines choric masking not as invisibility, but as non-singularity. A locus is masked if its trace law lies within (or near) the convex hull of admissible traces generated by other loci, roles, or cohorts.

• Theorem 8.1 (Measurement-Polytope Equivalence): Perfect masking for a finite audience is equivalent to the intersection of the projected polytopes of the trace laws.
• Theorem 14.5 (Convex Chorus Theorem): Two loci are perfectly masked if and only if their choric hulls intersect.

2. Finite Certificates for Indistinguishability

The calculus provides constructive, finite-dimensional certificates for security claims:

• Separation Certificates: If masking fails, a separating hyperplane (a bounded public score) exists that distinguishes the loci.
• Residue Theorem (Theorem 15.1): If leakage exists, there is a finite trace pattern (a cylinder event) that carries it. Leakage is not mystical; it is carried by concrete gestures.
• Localization Certificates: The paper distinguishes between detecting a residue and localizing it to a specific layer (e.g., person vs. object vs. cohort). A residue may be detectable but non-localizable if it falls within the measurement hull of multiple layer values.

3. Attention and Aperture Effects

The paper formalizes how bounded attention alters security:

• Attention-Filtered Distance: A residue visible in the full trace may vanish for a bounded observer. Theorem 11.7 provides an aperture bound, showing that the perceived residue is proportional to the probability that the observer's gaze hits the diagnostic coordinates.
• Split Pairs: A pair of laws can be exposed to a full-trace audience but perfectly masked to an attention-filtered audience.

4. Post-Release and Linked Room Dynamics

The model accounts for residues that emerge after the initial gate:

• Burden-Induced Exposure: A carried object or state may decay or create a hazard in a downstream "room," narrowing future scripts and creating a second exposure floor even if the first room was masked (Theorem 21.9).
• Linked Room Accounting: The paper provides an accounting rule separating first-room residue from link discrepancy (Theorem 20.3).

5. Repeated Unresolved Pressure and Debt

A significant contribution is the analysis of repeated interactions where residue is not localized:

• Choric Risk Debt: Unresolved residue accumulates as a debt variable ($D_k$).
• Externalization Trichotomy (Theorem 18.20): When debt increases, the system must either clear the debt, localize the source, or externalize the risk.
• Displaced-Risk Masking: If the system cannot localize the source, it may broaden its selection (increasing the cover cell size $m_k$) to manage debt. This dilutes attention per candidate, potentially lowering the hazard to the true carrier while increasing the selection probability of non-carriers (false positives). Theorem 18.12 proves that increasing breadth without localization can drive the guaranteed carrier hazard to zero even as room pressure rises.

Results and Theoretical Bounds

• Unique Gesture Lower Bound (Theorem 16.3): If a hidden locus is forced to perform a gesture (event) that others cannot match with sufficient mass, masking is impossible. The exposure floor is determined by the gap in attainable mass intervals.
• Fano-Type Localization Bound (Theorem 8.6): To guarantee correct localization with probability $q$, the observation channel must carry mutual information $I(\Sigma; Z) \ge q \log m - \log 2$, where $m$ is the cover size.
• Helly Certificate (Theorem 10.10): For a group of $k$ measurements, a common mask can be certified by checking only $(k+1)$-wise intersections of measurement hulls.
• Budget Required to Defeat Dilution (Theorem 18.14): To guarantee a hazard $\zeta$ for every carrier in a cover cell of size $m$, the attention budget must scale linearly with $m$.

Significance and Claims

The paper claims to provide a finite, inspectable, and compositional framework for auditing public-facing systems. Its significance lies in:

1. Operationalizing Privacy: It moves beyond asymptotic slogans to finite horizon claims about what a bounded audience can infer.
2. Separating Concepts: It rigorously distinguishes between absence of residue, residue outside the aperture, and residue displaced onto a cover population.
3. Auditability: Every masking assertion has a finite witness (a coupling or hull intersection), and every exposure assertion has a public carrier (a separating test).
4. Institutional Design: The "debt theorems" serve as an audit instrument, showing that broad responses to unresolved residue without localization certificates merely externalize risk to cover populations without resolving the original threat.

The authors assert that the theory does not assume malice or guilt but focuses on the statistical separation of trace laws. The calculus is designed to certify when a room can attribute a residue and when it cannot, ensuring that pressure is either localized or recognized as displaced. The paper concludes that a system is safe only when its visible grammar supplies sufficient cover and its audience model accurately reflects what is actually perceived.