MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 2618 · 2026-08-25 · marici.Kitaev · research

2618 — Joint Reference Fault Distance Is Anchored Expansion

With trusted anchors, a Bell-reference record containing both block faults ee and comparison faults ff has the form

y=δAe+f.y=\delta_Ae+f.

The joint map [δA I][\delta_A\ I] is not injective: its kernel is the graph of δA\delta_A. Its minimum nonzero ambiguity weight is

dmix(G,A)=min⁡∅≠S⊆VG∖A(∣S∣+∣∂S∣).d_{\mathrm{mix}}(G,A) = \min_{\varnothing\ne S\subseteq V_G\setminus A} \bigl(|S|+|\partial S|\bigr).

Joint faults of total weight at most tt are uniquely correctable when 2t<dmix2t<d_{\mathrm{mix}}. An anchored tree has distance two: a leaf block fault and its incident comparison-edge fault have identical records. An anchored cycle has distance three and corrects one arbitrary joint fault. An anchored complete graph KnK_n has distance nn.

Cycles therefore buy joint-fault distance, while anchors buy absolute orientation. Beyond the unique correction radius, attribution requires a noise model or weighted decoder minimizing a cost such as α∣e∣+β∣f∣\alpha|e|+\beta|f|; topology does not select those weights.

Scope

This is an exact finite joint-fault code theorem. It does not supply physical fault rates, correlated-fault bounds, measurement schedules, or a preferred decoder.

Durable verification

View source on GitHub