Historical circuit claim register (preserved companion)
Quantum and Circuits
CLAIMS.md
1 # Claim register
2
3 Only C01–C08 are active mathematical claims in version 1.0.0. Older archives are historical evidence, not automatic additions to this register. “Written” means a supplied self-reviewed argument; “finite” means execution in the exact range stated.
4
5 ## C01 — Exact cut-comparison cover
6
7 **Statement.** For every restored classical oracle and every cut, H_i<=f and OR_i H_i=f.
8
9 **Proof.** [FOUNDATIONS.md](FOUNDATIONS.md), section F2. **Status:** FINITE and WRITTEN.
10
11 **Computation.** All 276 functions through three inputs, with explicitly constructed restored circuits.
12
13 **Boundary.** No universal circuit-size lower bound follows solely from packet count.
14
15 ## C02 — Complete-cover lower bound and dual certificates
16
17 **Statement.** T>=max(0,deg(f)-1,2 beta*(f)-3), with exact evaluation-span characterization of beta_v.
18
19 **Proof.** [THEORY.md](THEORY.md), section 1. **Status:** FINITE and WRITTEN.
20
21 **Computation.** Full four-input profile table; independent rank checks only on the documented 765 cases.
22
23 **Boundary.** beta*<=n; bounded controls are not universal machine checking.
24
25 ## C03 — Unbalanced-OR calibration
26
27 **Statement.** For k>=2, F_k=ab OR product(z_i): max affine alpha_1=3 and beta*=k+1.
28
29 **Proof.** [THEORY.md](THEORY.md), section 2. **Status:** FINITE and WRITTEN.
30
31 **Computation.** Full designated family tables through nine inputs; all affine masks only through eight.
32
33 **Boundary.** Easy linear-size family; no exact optimum claimed when lower and upper bounds differ.
34
35 ## C04 — Optimal small restored oracles
36
37 **Statement.** The complete-cover bound is attained by explicit classical implementations for all functions on one, two, or three inputs.
38
39 **Proof.** [THEORY.md](THEORY.md), section 2. **Status:** FINITE and WRITTEN.
40
41 **Computation.** All 276 functions; 28 zero-, 120 one-, and 128 three-Toffoli implementations.
42
43 **Boundary.** Optimality combines the written lower bound and constructed witnesses; not exhaustive circuit search.
44
45 ## C05 — Projection cost and safety counterexample
46
47 **Statement.** A family with n=2^m-2 has T(P_m)=2m-3 and T([P_m]_2)=n/2; the extracted grade can be unsafe.
48
49 **Proof.** [THEORY.md](THEORY.md), section 3. **Status:** COUNTEREXAMPLE, FINITE and WRITTEN.
50
51 **Computation.** Ranks and pair coefficients through m=10; full truth tables only m=2,3,4.
52
53 **Boundary.** Exponential in m, linear in n; not an exponential total-gate separation.
54
55 ## C06 — Faithful flat gluing dimension
56
57 **Statement.** A linear multiplicative witness-algebra map retaining every primitive witness idempotent has target dimension at least 2^m.
58
59 **Proof.** [THEORY.md](THEORY.md), section 4. **Status:** FINITE controls and WRITTEN.
60
61 **Computation.** Small scalar-map controls; the universal argument is orthogonal-idempotent independence.
62
63 **Boundary.** Restricted fixed-summary theorem; dimension is not arbitrary circuit cost.
64
65 ## C07 — Weighted witness fingerprint
66
67 **Statement.** Distinct witness monomials give an exact nonzero/satisfiable equivalence and Boolean top-coefficient identity.
68
69 **Proof.** [THEORY.md](THEORY.md), section 5. **Status:** FINITE and WRITTEN; algorithmic implication CONDITIONAL.
70
71 **Computation.** All designated verifiers through three witness bits; exact GF16 evaluation and specified extraction grids.
72
73 **Boundary.** Implemented evaluator is exponential. An efficient evaluator would give the stated randomized implication, not a deterministic P=NP proof.
74
75 ## C08 — Overlap obstruction to multiplicative trace
76
77 **Statement.** The weighted trace multiplies on disjoint variables and fails on the displayed overlapping one-bit predicates.
78
79 **Proof.** [THEORY.md](THEORY.md), section 5. **Status:** COUNTEREXAMPLE, FINITE and WRITTEN.
80
81 **Computation.** Exact GF16 counterexamples and 4,096 disjoint controls.
82
83 **Boundary.** Does not exclude context-dependent nonlinear algorithms.
84
85 Machine-readable form: [claims.json](claims.json). Finite output records are in `evidence/baseline/`; the release replay is documented in `evidence/closure/`.