From 95bb52132797c0ed189f8558b74b048433922f74 Mon Sep 17 00:00:00 2001 From: Ali Romman <226877337+aliromman@users.noreply.github.com> Date: Wed, 18 Nov 2026 20:22:53 -0500 Subject: [PATCH] Certify the exact rational split optimum for fixed P104 flags --- .../.gitattributes | 1 + .../p104-fixed-flag-split-optimum/CREDITS.md | 29 +++ .../p104-fixed-flag-split-optimum/PROOF.md | 194 ++++++++++++++ .../p104-fixed-flag-split-optimum/README.md | 33 +++ .../p104-fixed-flag-split-optimum/RESULT.json | 106 ++++++++ .../SOURCE-PINS.json | 53 ++++ .../SOURCES.json | 18 ++ .../p104-fixed-flag-split-optimum/TASK.json | 123 +++++++++ .../p104-fixed-flag-split-optimum/VERIFY.json | 32 +++ .../retained/source7748/README.md | 97 +++++++ .../retained/source7748/SOURCES.json | 18 ++ .../retained/source7748/TASK.json | 123 +++++++++ .../retained/source7748/VERIFY.json | 34 +++ .../retained/source7748/WITNESS.json | 139 ++++++++++ .../retained/source7748/verify.py | 207 +++++++++++++++ .../p104-fixed-flag-split-optimum/verify.py | 242 ++++++++++++++++++ 16 files changed, 1449 insertions(+) create mode 100644 research/p104-fixed-flag-split-optimum/.gitattributes create mode 100644 research/p104-fixed-flag-split-optimum/CREDITS.md create mode 100644 research/p104-fixed-flag-split-optimum/PROOF.md create mode 100644 research/p104-fixed-flag-split-optimum/README.md create mode 100644 research/p104-fixed-flag-split-optimum/RESULT.json create mode 100644 research/p104-fixed-flag-split-optimum/SOURCE-PINS.json create mode 100644 research/p104-fixed-flag-split-optimum/SOURCES.json create mode 100644 research/p104-fixed-flag-split-optimum/TASK.json create mode 100644 research/p104-fixed-flag-split-optimum/VERIFY.json create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/README.md create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/SOURCES.json create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/TASK.json create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/VERIFY.json create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/WITNESS.json create mode 100644 research/p104-fixed-flag-split-optimum/retained/source7748/verify.py create mode 100644 research/p104-fixed-flag-split-optimum/verify.py diff --git a/research/p104-fixed-flag-split-optimum/.gitattributes b/research/p104-fixed-flag-split-optimum/.gitattributes new file mode 100644 index 0000000000..130a3ecaa2 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/.gitattributes @@ -0,0 +1 @@ +retained/** -text whitespace=cr-at-eol diff --git a/research/p104-fixed-flag-split-optimum/CREDITS.md b/research/p104-fixed-flag-split-optimum/CREDITS.md new file mode 100644 index 0000000000..21067f6dba --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/CREDITS.md @@ -0,0 +1,29 @@ +# Sources and credit + +Ali Romman (@aliromman) prepared the exact optimization, certificate, +proof and checker with substantial OpenAI Codex assistance. New material +is Apache-2.0. No independent human or formal proof-kernel acceptance +is claimed. + +Nick Petalas (@petalas) supplied the signed split witness, compact +geometry, source formula and open optimization question in +[PR #7748](https://github.com/CrocSwap/integer-mult-bounds/pull/7748). +The [source proof](https://github.com/petalas/integer-mult-bounds/blob/5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e/research/p104-c56-split-gather-witness/README.md), +[geometry and flags](https://github.com/petalas/integer-mult-bounds/blob/5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e/research/p104-c56-split-gather-witness/WITNESS.json) +and [checker](https://github.com/petalas/integer-mult-bounds/blob/5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e/research/p104-c56-split-gather-witness/verify.py) +are retained with all six package files at that exact commit. The checker +runs unchanged; the new code uses its authenticated geometry routines. +The shared CI changes in that commit are not copied into this package. + +The source credits DreamingOfClouds (@DreamingOfClouds), with Claude Opus +5.5 assistance, for the C=56 flag model, chain configuration and split-gather +question in [PR #7689](https://github.com/CrocSwap/integer-mult-bounds/pull/7689), +at source head `511e7d0852acdca291b50c538b978fb063ae7bac`. +The original notice and geometry provenance remain in the retained source +proof. This package does not replay its global lower-bound or Lean suites. + +The new contribution is the exact rational optimum across all 104 columns +of these fixed flags, with integer inconsistency certificates and a full +attaining schedule. `SOURCE-PINS.json` authenticates the six retained files. +`SOURCES.json` records selected-record and catalogue provenance at canonical +main. Content pins do not assert unmerged ancestry. diff --git a/research/p104-fixed-flag-split-optimum/PROOF.md b/research/p104-fixed-flag-split-optimum/PROOF.md new file mode 100644 index 0000000000..ce4956993e --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/PROOF.md @@ -0,0 +1,194 @@ +# Exact split-gather optimum for eight fixed flags + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. + +## Result and contract + +Fix the geometry, eight chain pairs and eight ordered flags in Nick Petalas's +[PR #7748](https://github.com/CrocSwap/integer-mult-bounds/pull/7748), at +`5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e`. Use its one-read-per-chain model. +For every source column and active chain, allow arbitrary rational gather +pieces at legal levels. The pieces must sum to one on that chain. Count the +nonzero even off-diagonal entries of the complete 104-by-104 decoder. + +**The exact minimum is 4,745.** With one gather per active chain, the minimum +on these same flags is 4,814. Signed splitting removes 69 entries across +44 improved columns. Source column 4 has minimum 43, compared with the +published split value 44 and the single-gather minimum 45. + +The matching schedule has 490 nonzero gather pieces across 416 active +column-chain pairs. Every diagonal entry is 2 and all 5,720 odd off-diagonal +entries are zero. The piece count is the cost of this witness only; no +minimum piece count or physical cost optimum is claimed. + +The fixed flags are essential. DreamingOfClouds's +[PR #7689](https://github.com/CrocSwap/integer-mult-bounds/pull/7689) +reports a 4,216-entry witness over other flags. That witness is not replayed +here. The present result does not improve the reported best global decoder, +its class ceiling, a complete supplier, or kappa. + +## 1. Replace pieces by free prefix coefficients + +Let tau_k(t) be the reader birth level and sigma_k(s) the gather deadline. +These are reconstructed from the pinned binary flags. Let w_k(s,t) be the +integer Gram weight in the source formula. If a_k,g is the gather piece at +level g, define + +```text +c_k,j = sum_(0 <= g < j) a_k,g. +``` + +For an active chain and a fixed source s, legality and total coefficient one +are equivalent to + +```text +c_k,0 = 0; +c_k,j is an arbitrary rational for 1 <= j <= sigma_k(s); +c_k,j = 1 for j > sigma_k(s). +``` + +In one direction, sum the legal pieces. In the other direction, recover +`a_k,g = c_k,g+1 - c_k,g` for `0 <= g <= sigma_k(s)`. These differences +have sum one and use only legal levels. There are at most eight levels. +Thus the free rational prefix variables describe the entire stated class; +there is no coefficient bound, denominator bound or finite-value search. +Variables that have zero weight at every reader can be omitted. + +Each decoder entry is the affine rational form + +```text +D_t,s = sum_k w_k(s,t) c_k,tau_k(t). +``` + +The verifier reconstructs this form for every one of the 10,816 entries. +All 104 diagonal forms are the constant 2. All 5,720 odd off-diagonal +forms are the constant zero. Thus these requirements impose no remaining +constraint on the free prefixes. Choices in different source columns +are independent within this formal decoder contract. + +## 2. Certify the maximum number of zero forms + +There are 48 even off-diagonal positions per source column. In total, +4,715 forms are constant and nonzero. They must remain in the junk set. +The other 277 positions depend on at most six variables per column. +Group forms whose zero equations are the same. Normalize each integer +row, including its constant term, by the greatest common divisor and +make its first nonzero entry positive. Its weight is the number of +positions represented by that equation. + +For each column, let the distinct equations be `A_i x + b_i = 0`, with +weights `w_i`. There are at most eight distinct equations in any column. +The certificate gives 23 incompatible subsets across all columns. Each +has explicit integer coefficients lambda with + +```text +sum_i lambda_i A_i = 0, +sum_i lambda_i b_i != 0. +``` + +Such a subset cannot consist entirely of zero entries, over Q or over R. +Enumerate the subsets of equations that contain no certified incompatible +subset, and find their maximum total weight. Every actual zero set is +among these subsets, so this yields an upper bound on zero entries. +Subtract it from the number of variable entries to get a lower bound on +nonzeros. It is enough that the listed contradictions are sound; the +matching schedule below proves that the bound is sharp. + +For a separate check, rational Gaussian elimination tests consistency of +all subsets directly, without the contradiction list. Its feasible subsets +agree exactly with the contradiction test. There are only 1,400 subsets +across all 104 columns, including each empty subset. + +The only columns with a positive additional penalty are: + +| Source column | Extra nonzeros beyond its fixed entries | +| --- | ---: | +| 4 | 3 | +| 13 | 1 | +| 18 | 1 | +| 38 | 1 | +| 41 | 2 | +| 49 | 1 | +| 53 | 1 | +| 59 | 1 | +| 65 | 4 | +| 69 | 1 | +| 72 | 2 | +| 82 | 7 | +| 83 | 1 | +| 84 | 1 | +| 88 | 2 | +| 92 | 1 | + +Their sum is 30. Hence the complete decoder has at least +`4715 + 30 = 4745` junk entries. `RESULT.json` gives each column's +variables, normalized equations, weights, contradiction coefficients, +minimum, attaining prefix values and legal gather pieces. + +## 3. Matching schedule and single-gather comparison + +The certificate supplies a rational point for each column. Convert it to +gather pieces by the difference formula in Section 1. Both the unchanged +source routine and a separate direct sum over individual pieces produce +the same complete decoder. Its affine forms also give the same entries. +The schedule has exactly the lower-bound number in every column, so the +sum 4,745 is attained. + +The verifier separately enumerates all legal single-gather schedules in +each column. There are 1,242 schedules in total across the independent +column problems. Their minima sum to 4,814. This is not enumeration of the +Cartesian product of all column schedules; independence makes that product +unnecessary. Exactly 44 columns improve with splitting. + +Column 4 gives a small example that can be checked without the full table. +Write `x2,x3,x4` for the chain-3 prefixes at levels 2,3,4, and `y1` for +the chain-6 prefix at level 1. There are 40 fixed nonzeros. The other +zero equations and their weights are + +```text +y1 = 2 weight 1 +x4 = 2 weight 2 +x4 = 0 weight 2 +x3 = 2 weight 1 +x3 = 0 weight 1 +x2 = 2 weight 1. +``` + +At least two positions survive the contradictory x4 pair and at least one +survives the x3 pair. Set all four variables to 2. This gives 43 nonzeros. +An attaining gather schedule is + +```text +chain 0: (level 0, +1) +chain 2: (level 0, +1) +chain 3: (level 1, +2), (level 4, -1) +chain 5: (level 0, +1) +chain 6: (level 0, +2), (level 1, -1). +``` + +The unobserved chain-3 prefix at level 1 is zero in this witness. Moving its +first piece from level 1 to level 0 has no effect on the weighted readers. +The chain-6 split removes one more entry than the predecessor's 44-entry +schedule. Replacing `y1=2` by `y1=1` restores that entry and gives 44. + +## Verification and limits + +The six retained source files have exact Git blob and SHA-256 pins. The +source geometry reconstructs the Gram matrix from eight basis profiles, +checks binary label parity, and authenticates the original 104-port matrix +and label hashes. The unchanged source verifier also runs in each mode. + +The new checker verifies all affine forms, the 23 integer contradictions, +all 1,400 subsets by two methods, every matching schedule, and all 1,242 +single-gather schedules. Four additional rational prefix families give +416 full column checks, including negative and nonintegral coefficients. +Controls reject a false contradiction, a lost optimum, a late gather and +a wrong total. Removing a necessary contradiction lowers the claimed +bound, as expected. + +All data and arithmetic are exact. The proof and finite certificate are +open to independent review; no human or formal proof-kernel acceptance is +claimed. The full PR7689 Lean and global flag suites, selected cold replay +and Docker were not run. More flag choices, split reads, other row models, +native realization, transport, storage, restoration and the complete paid +caller invoice remain open. All five selected framework assumptions remain. diff --git a/research/p104-fixed-flag-split-optimum/README.md b/research/p104-fixed-flag-split-optimum/README.md new file mode 100644 index 0000000000..eb2c418fbc --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/README.md @@ -0,0 +1,33 @@ +# Exact rational split optimum for fixed P104 flags + +The eight flags in PR7748 have exact split-gather junk minimum **4,745**. +The single-gather minimum on these flags is **4,814**. A complete schedule +attains all 104 column minima, including **43** in source column 4, where +the predecessor attained 44. It uses 490 nonzero gather pieces and keeps +every diagonal and required odd zero. + +Read [PROOF.md](PROOF.md), [RESULT.json](RESULT.json), [verify.py](verify.py), +[SOURCE-PINS.json](SOURCE-PINS.json) and [CREDITS.md](CREDITS.md). +The lower bound uses 4,715 fixed entries and 23 exact contradictions that +force 30 more. Two methods agree on all 1,400 equation subsets. + +Use Python 3.12 and its standard library from the repository root: + +```sh +python3.12 -B scripts/research_package.py --package research/p104-fixed-flag-split-optimum +``` + +Both modes print `PASS_P104_FIXED_FLAG_SPLIT_OPTIMUM`. There is no new +kappa or global flag optimum. Physical gather and restoration costs are +not supplied. All five framework assumptions remain. + +## Open next questions + +- Apply the same exact prefix equations to an available low-junk flag + witness. The fixed flags here remain worse than the 4,216-entry witness + reported in PR7689; that witness was not replayed here. +- Price the extra pieces and their restoration on a specified native + carrier. This schedule uses 74 more nonzero pieces than active chains. + A decrease in junk entries alone is not a paid supplier improvement. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. diff --git a/research/p104-fixed-flag-split-optimum/RESULT.json b/research/p104-fixed-flag-split-optimum/RESULT.json new file mode 100644 index 0000000000..de21feaf73 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/RESULT.json @@ -0,0 +1,106 @@ +[ +{"column":0,"variables":[[1,2],[1,3]],"groups":[[[0,1,0],2],[[1,0,0],1]],"forced":45,"conflicts":[],"witness":["0","0"],"minimum":45,"unsplit_minimum":45,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"0":[[1,"1"]],"1":[[3,"1"]],"2":[[2,"1"]],"3":[[0,"1"]]}}, +{"column":1,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"2":[[1,"1"]],"7":[[0,"1"]]}}, +{"column":2,"variables":[[5,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"2":[[1,"1"]],"4":[[0,"1"]],"5":[[1,"1"]]}}, +{"column":3,"variables":[[6,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":2,"feasible_subsets":2,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"6":[[1,"1"]]}}, +{"column":4,"variables":[[3,2],[3,3],[3,4],[6,1]],"groups":[[[0,0,0,1,-2],1],[[0,0,1,0,-2],2],[[0,0,1,0,0],2],[[0,1,0,0,-2],1],[[0,1,0,0,0],1],[[1,0,0,0,-2],1]],"forced":40,"conflicts":[{"mask":6,"lambda_":[-1,1]},{"mask":24,"lambda_":[-1,1]}],"witness":["2","2","2","2"],"minimum":43,"unsplit_minimum":45,"unsplit_schedules":10,"feasible_subsets":36,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"3":[[1,"2"],[4,"-1"]],"5":[[0,"1"]],"6":[[0,"2"],[1,"-1"]]}}, +{"column":5,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"1":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":6,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"3":[[0,"1"]]}}, +{"column":7,"variables":[[3,2],[4,1]],"groups":[[[0,1,0],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","0"],"minimum":46,"unsplit_minimum":46,"unsplit_schedules":54,"feasible_subsets":4,"schedule":{"0":[[1,"1"]],"3":[[2,"1"]],"4":[[2,"1"]],"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":8,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":3,"feasible_subsets":1,"schedule":{"0":[[2,"1"]],"2":[[0,"1"]],"4":[[0,"1"]]}}, +{"column":9,"variables":[[1,2],[1,3]],"groups":[[[0,1,0],2],[[1,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":4,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"1":[[1,"2"],[2,"-2"],[3,"1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":10,"variables":[[5,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"5":[[0,"2"],[1,"-1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":11,"variables":[[4,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":12,"feasible_subsets":2,"schedule":{"1":[[1,"1"]],"4":[[1,"1"]],"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":12,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"3":[[1,"1"]],"4":[[0,"1"]]}}, +{"column":13,"variables":[[0,3],[3,2],[3,3],[5,1],[5,2]],"groups":[[[0,0,0,0,1,-2],1],[[0,0,0,1,0,-2],1],[[0,0,1,0,0,0],1],[[0,1,0,0,0,-2],1],[[1,0,-1,0,0,1],1],[[1,0,0,0,0,-2],1]],"forced":42,"conflicts":[{"mask":52,"lambda_":[-1,-1,1]}],"witness":["-1","2","0","2","2"],"minimum":43,"unsplit_minimum":47,"unsplit_schedules":96,"feasible_subsets":56,"schedule":{"0":[[2,"-1"],[3,"2"]],"1":[[0,"1"]],"3":[[1,"2"],[2,"-2"],[3,"1"]],"5":[[0,"2"],[2,"-1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":14,"variables":[[5,1],[5,2],[5,3]],"groups":[[[0,0,1,0],1],[[0,1,0,0],1],[[1,0,0,0],1]],"forced":45,"conflicts":[],"witness":["0","0","0"],"minimum":45,"unsplit_minimum":45,"unsplit_schedules":16,"feasible_subsets":8,"schedule":{"0":[[1,"1"]],"3":[[1,"1"]],"4":[[0,"1"]],"5":[[3,"1"]]}}, +{"column":15,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"1":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":16,"variables":[[5,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":12,"feasible_subsets":2,"schedule":{"0":[[2,"1"]],"1":[[0,"1"]],"4":[[0,"1"]],"5":[[1,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":17,"variables":[[3,2],[4,1]],"groups":[[[0,1,-2],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"0":[[1,"1"]],"1":[[0,"1"]],"2":[[1,"1"]],"3":[[2,"1"]],"4":[[0,"2"],[1,"-1"]],"6":[[0,"1"]]}}, +{"column":18,"variables":[[4,1],[4,3]],"groups":[[[0,1,-2],1],[[0,1,0],1],[[1,0,-2],1]],"forced":45,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":12,"feasible_subsets":6,"schedule":{"2":[[2,"1"]],"3":[[0,"1"]],"4":[[0,"2"],[1,"-2"],[2,"2"],[3,"-1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":19,"variables":[[1,2],[1,3]],"groups":[[[0,1,0],2],[[1,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"1":[[1,"2"],[2,"-2"],[3,"1"]],"3":[[1,"1"]],"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":20,"variables":[[4,1],[5,1],[5,2]],"groups":[[[0,0,1,0],1],[[0,1,0,0],1],[[1,0,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":9,"feasible_subsets":8,"schedule":{"0":[[0,"1"]],"4":[[0,"2"],[1,"-2"],[2,"1"]],"5":[[2,"1"]]}}, +{"column":21,"variables":[[1,2]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":2,"schedule":{"1":[[1,"2"],[2,"-1"]],"3":[[1,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":22,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"3":[[0,"1"]]}}, +{"column":23,"variables":[[7,3]],"groups":[[[1,-2],3]],"forced":45,"conflicts":[],"witness":["2"],"minimum":45,"unsplit_minimum":48,"unsplit_schedules":8,"feasible_subsets":2,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"5":[[0,"1"]],"7":[[2,"2"],[3,"-1"]]}}, +{"column":24,"variables":[[6,1],[6,2],[6,3],[6,4],[6,5]],"groups":[[[0,0,0,0,1,0],8],[[0,0,0,1,0,0],1],[[0,0,1,0,0,0],3],[[0,1,0,0,0,0],1],[[1,0,0,0,0,0],1]],"forced":34,"conflicts":[],"witness":["0","0","0","0","0"],"minimum":34,"unsplit_minimum":34,"unsplit_schedules":6,"feasible_subsets":32,"schedule":{"4":[[0,"1"]],"5":[[0,"1"]],"6":[[5,"1"]]}}, +{"column":25,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":26,"variables":[[7,3],[7,4]],"groups":[[[0,1,0],2],[[1,0,-2],3]],"forced":43,"conflicts":[],"witness":["2","0"],"minimum":43,"unsplit_minimum":46,"unsplit_schedules":10,"feasible_subsets":4,"schedule":{"0":[[1,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"5":[[0,"1"]],"7":[[2,"2"],[3,"-2"],[4,"1"]]}}, +{"column":27,"variables":[[1,2],[6,1],[6,2],[6,3]],"groups":[[[0,0,0,1,0],3],[[0,0,1,0,0],1],[[0,1,0,0,0],1],[[1,0,0,0,0],1]],"forced":42,"conflicts":[],"witness":["0","0","0","0"],"minimum":42,"unsplit_minimum":42,"unsplit_schedules":24,"feasible_subsets":16,"schedule":{"0":[[0,"1"]],"1":[[2,"1"]],"3":[[1,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"6":[[3,"1"]]}}, +{"column":28,"variables":[[7,3],[7,4]],"groups":[[[0,1,0],2],[[1,0,0],3]],"forced":43,"conflicts":[],"witness":["0","0"],"minimum":43,"unsplit_minimum":43,"unsplit_schedules":5,"feasible_subsets":4,"schedule":{"1":[[0,"1"]],"3":[[0,"1"]],"7":[[4,"1"]]}}, +{"column":29,"variables":[[4,1],[5,1],[5,2],[6,1],[6,2],[6,3]],"groups":[[[0,0,0,0,0,1,0],3],[[0,0,0,0,1,0,0],1],[[0,0,0,1,0,0,0],1],[[0,0,1,0,0,0,-2],1],[[0,1,0,0,0,0,-2],1],[[1,0,0,0,0,0,0],1]],"forced":40,"conflicts":[],"witness":["0","2","2","0","0","0"],"minimum":40,"unsplit_minimum":42,"unsplit_schedules":24,"feasible_subsets":64,"schedule":{"4":[[1,"1"]],"5":[[0,"2"],[2,"-1"]],"6":[[3,"1"]],"7":[[0,"1"]]}}, +{"column":30,"variables":[[1,2],[4,1],[6,1],[6,2]],"groups":[[[0,0,0,1,-2],1],[[0,0,1,0,-2],1],[[0,1,0,0,0],1],[[1,0,0,0,-2],1]],"forced":44,"conflicts":[],"witness":["2","0","2","2"],"minimum":44,"unsplit_minimum":47,"unsplit_schedules":108,"feasible_subsets":16,"schedule":{"0":[[1,"1"]],"1":[[1,"2"],[2,"-1"]],"4":[[2,"1"]],"6":[[0,"2"],[2,"-1"]],"7":[[1,"1"]]}}, +{"column":31,"variables":[[5,1],[6,1],[6,2],[6,3],[6,4],[6,5]],"groups":[[[0,0,0,0,0,1,0],8],[[0,0,0,0,1,0,0],1],[[0,0,0,1,0,0,0],3],[[0,0,1,0,0,0,0],1],[[0,1,0,0,0,0,0],1],[[1,0,0,0,0,0,-2],1]],"forced":33,"conflicts":[],"witness":["2","0","0","0","0","0"],"minimum":33,"unsplit_minimum":34,"unsplit_schedules":72,"feasible_subsets":64,"schedule":{"2":[[2,"1"]],"3":[[0,"1"]],"5":[[0,"2"],[1,"-1"]],"6":[[5,"1"]],"7":[[1,"1"]]}}, +{"column":32,"variables":[[6,1],[6,2]],"groups":[[[0,1,-2],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","2"],"minimum":46,"unsplit_minimum":48,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"1":[[1,"1"]],"2":[[1,"1"]],"3":[[1,"1"]],"6":[[0,"2"],[2,"-1"]],"7":[[0,"1"]]}}, +{"column":33,"variables":[[4,1],[4,3]],"groups":[[[0,1,0],2],[[1,0,0],1]],"forced":45,"conflicts":[],"witness":["0","0"],"minimum":45,"unsplit_minimum":45,"unsplit_schedules":12,"feasible_subsets":4,"schedule":{"0":[[2,"1"]],"3":[[0,"1"]],"4":[[3,"1"]]}}, +{"column":34,"variables":[[4,1],[5,1]],"groups":[[[0,1,0],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","0"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"2":[[2,"1"]],"3":[[1,"1"]],"4":[[0,"2"],[1,"-1"]],"5":[[1,"1"]]}}, +{"column":35,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":12,"feasible_subsets":1,"schedule":{"2":[[3,"1"]],"3":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":36,"variables":[[4,1],[5,1],[5,2]],"groups":[[[0,0,1,0],1],[[0,1,0,0],1],[[1,0,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":6,"feasible_subsets":8,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"4":[[0,"2"],[1,"-1"]],"5":[[2,"1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":37,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"1":[[1,"1"]],"3":[[0,"1"]],"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":38,"variables":[[3,2],[3,3]],"groups":[[[0,1,-2],1],[[0,1,0],1],[[1,0,-2],1]],"forced":45,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":8,"feasible_subsets":6,"schedule":{"0":[[1,"1"]],"2":[[0,"1"]],"3":[[1,"2"],[3,"-1"]],"4":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":39,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"4":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":40,"variables":[[1,2],[1,3],[1,4],[4,1]],"groups":[[[0,0,0,1,0],1],[[0,0,1,0,0],4],[[0,1,0,0,0],2],[[1,0,0,0,0],1]],"forced":40,"conflicts":[],"witness":["0","0","0","0"],"minimum":40,"unsplit_minimum":40,"unsplit_schedules":40,"feasible_subsets":16,"schedule":{"0":[[1,"1"]],"1":[[4,"1"]],"3":[[1,"1"]],"4":[[1,"1"]]}}, +{"column":41,"variables":[[3,2],[3,3],[3,4],[5,1]],"groups":[[[0,0,0,1,-2],1],[[0,0,1,0,-2],2],[[0,0,1,0,0],2],[[0,1,0,0,-2],2],[[1,0,0,0,0],1]],"forced":40,"conflicts":[{"mask":6,"lambda_":[-1,1]}],"witness":["0","2","2","2"],"minimum":42,"unsplit_minimum":45,"unsplit_schedules":10,"feasible_subsets":24,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"3":[[2,"2"],[4,"-1"]],"5":[[0,"2"],[1,"-1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":42,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":43,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"1":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":44,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":12,"feasible_subsets":1,"schedule":{"2":[[3,"1"]],"4":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":45,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"2":[[1,"1"]],"3":[[0,"1"]]}}, +{"column":46,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":3,"feasible_subsets":1,"schedule":{"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":47,"variables":[[1,2]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":3,"feasible_subsets":2,"schedule":{"1":[[2,"1"]],"2":[[0,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":48,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":49,"variables":[[5,1],[5,2],[5,3],[5,4]],"groups":[[[0,0,0,1,-2],1],[[0,0,0,1,0],2],[[0,0,1,0,0],1],[[0,1,0,0,-2],1],[[1,0,0,0,-2],1]],"forced":42,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2","2","0","0"],"minimum":43,"unsplit_minimum":45,"unsplit_schedules":10,"feasible_subsets":24,"schedule":{"0":[[1,"1"]],"2":[[0,"1"]],"5":[[0,"2"],[2,"-2"],[4,"1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":50,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"3":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":51,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":1,"schedule":{"0":[[2,"1"]],"3":[[1,"1"]],"6":[[0,"1"]]}}, +{"column":52,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":9,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"1":[[0,"1"]],"2":[[2,"1"]],"3":[[0,"1"]],"4":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":53,"variables":[[3,2],[3,3]],"groups":[[[0,1,-2],1],[[0,1,0],1],[[1,0,-2],1]],"forced":45,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":8,"feasible_subsets":6,"schedule":{"0":[[1,"1"]],"1":[[0,"1"]],"3":[[1,"2"],[3,"-1"]],"4":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":54,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":55,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"3":[[1,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":56,"variables":[[5,1],[5,2],[5,3]],"groups":[[[0,0,1,0],1],[[0,1,0,-2],1],[[1,0,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","2","0"],"minimum":45,"unsplit_minimum":47,"unsplit_schedules":8,"feasible_subsets":8,"schedule":{"0":[[0,"1"]],"5":[[0,"2"],[2,"-2"],[3,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":57,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":58,"variables":[[4,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"2":[[1,"1"]],"4":[[1,"1"]]}}, +{"column":59,"variables":[[0,3]],"groups":[[[1,-2],1],[[1,0],1]],"forced":46,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":4,"feasible_subsets":3,"schedule":{"0":[[2,"2"],[3,"-1"]],"4":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":60,"variables":[[1,2],[1,3],[1,4],[1,5]],"groups":[[[0,0,0,1,0],4],[[0,0,1,0,0],4],[[0,1,0,0,0],2],[[1,0,0,0,0],1]],"forced":37,"conflicts":[],"witness":["0","0","0","0"],"minimum":37,"unsplit_minimum":37,"unsplit_schedules":6,"feasible_subsets":16,"schedule":{"1":[[5,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":61,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"2":[[1,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":62,"variables":[[1,2],[1,3]],"groups":[[[0,1,0],2],[[1,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":12,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"1":[[1,"2"],[2,"-2"],[3,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":63,"variables":[[4,1],[5,1]],"groups":[[[0,1,0],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","0"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"4":[[0,"2"],[1,"-2"],[2,"1"]],"5":[[1,"1"]]}}, +{"column":64,"variables":[[4,1],[5,1],[5,2]],"groups":[[[0,0,1,0],1],[[0,1,0,0],1],[[1,0,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","0","0"],"minimum":45,"unsplit_minimum":46,"unsplit_schedules":12,"feasible_subsets":8,"schedule":{"0":[[1,"1"]],"2":[[0,"1"]],"4":[[0,"2"],[1,"-1"]],"5":[[2,"1"]]}}, +{"column":65,"variables":[[1,2],[1,3],[1,4],[1,5],[7,3]],"groups":[[[0,0,0,0,1,0],2],[[0,0,0,1,0,-2],2],[[0,0,0,1,0,0],2],[[0,0,1,0,-1,-1],1],[[0,0,1,0,0,-2],2],[[0,0,1,0,0,0],1],[[0,1,0,0,0,0],2],[[1,0,0,0,0,-2],1]],"forced":35,"conflicts":[{"mask":6,"lambda_":[-1,1]},{"mask":25,"lambda_":[-1,-1,1]},{"mask":41,"lambda_":[-1,-1,1]},{"mask":48,"lambda_":[-1,1]}],"witness":["2","0","2","2","0"],"minimum":39,"unsplit_minimum":41,"unsplit_schedules":24,"feasible_subsets":120,"schedule":{"1":[[1,"2"],[2,"-2"],[3,"2"],[5,"-1"]],"2":[[0,"1"]],"3":[[0,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"7":[[3,"1"]]}}, +{"column":66,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"3":[[1,"1"]]}}, +{"column":67,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"1":[[1,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":68,"variables":[[6,1],[6,2]],"groups":[[[0,1,0],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","0"],"minimum":46,"unsplit_minimum":46,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"2":[[1,"1"]],"4":[[0,"1"]],"5":[[0,"1"]],"6":[[2,"1"]]}}, +{"column":69,"variables":[[6,1],[6,2],[6,3],[6,4]],"groups":[[[0,0,0,1,0],1],[[0,0,1,0,-2],1],[[0,0,1,0,0],2],[[0,1,0,0,-2],1],[[1,0,0,0,-2],1]],"forced":42,"conflicts":[{"mask":6,"lambda_":[-1,1]}],"witness":["2","2","0","0"],"minimum":43,"unsplit_minimum":45,"unsplit_schedules":15,"feasible_subsets":24,"schedule":{"0":[[0,"1"]],"1":[[0,"1"]],"2":[[2,"1"]],"4":[[0,"1"]],"6":[[0,"2"],[2,"-2"],[4,"1"]]}}, +{"column":70,"variables":[[0,3]],"groups":[[[1,0],2]],"forced":46,"conflicts":[],"witness":["0"],"minimum":46,"unsplit_minimum":46,"unsplit_schedules":24,"feasible_subsets":2,"schedule":{"0":[[3,"1"]],"2":[[0,"1"]],"3":[[1,"1"]],"7":[[2,"1"]]}}, +{"column":71,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":3,"feasible_subsets":1,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"7":[[2,"1"]]}}, +{"column":72,"variables":[[0,3],[0,4],[0,5],[3,2],[3,3]],"groups":[[[0,0,0,0,1,0],1],[[0,0,0,1,0,-2],1],[[0,0,1,0,0,0],6],[[0,1,0,0,0,-2],1],[[0,1,0,0,0,0],5],[[1,0,0,0,-1,1],1],[[1,0,0,0,0,0],1]],"forced":32,"conflicts":[{"mask":24,"lambda_":[-1,1]},{"mask":97,"lambda_":[-1,-1,1]}],"witness":["-1","0","0","2","0"],"minimum":34,"unsplit_minimum":35,"unsplit_schedules":24,"feasible_subsets":84,"schedule":{"0":[[2,"-1"],[3,"1"],[5,"1"]],"2":[[0,"1"]],"3":[[1,"2"],[2,"-2"],[3,"1"]]}}, +{"column":73,"variables":[[4,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":2,"feasible_subsets":2,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"4":[[1,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":74,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"4":[[0,"1"]]}}, +{"column":75,"variables":[[1,2]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":36,"feasible_subsets":2,"schedule":{"0":[[1,"1"]],"1":[[1,"2"],[2,"-1"]],"2":[[2,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":76,"variables":[[5,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"2":[[1,"1"]],"5":[[0,"2"],[1,"-1"]],"6":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":77,"variables":[[1,2]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":6,"feasible_subsets":2,"schedule":{"0":[[0,"1"]],"1":[[2,"1"]],"3":[[1,"1"]]}}, +{"column":78,"variables":[[5,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":2,"feasible_subsets":2,"schedule":{"4":[[0,"1"]],"5":[[1,"1"]]}}, +{"column":79,"variables":[[4,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"2":[[1,"1"]],"3":[[0,"1"]],"4":[[0,"2"],[1,"-1"]],"7":[[0,"1"]]}}, +{"column":80,"variables":[[3,2],[6,1]],"groups":[[[0,1,0],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","0"],"minimum":46,"unsplit_minimum":46,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"1":[[0,"1"]],"3":[[2,"1"]],"6":[[1,"1"]]}}, +{"column":81,"variables":[[6,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"0":[[1,"1"]],"3":[[0,"1"]],"5":[[0,"1"]],"6":[[0,"2"],[1,"-1"]]}}, +{"column":82,"variables":[[3,2],[3,3],[3,4],[3,5],[7,3]],"groups":[[[0,0,0,0,1,0],3],[[0,0,0,1,0,-2],4],[[0,0,0,1,0,0],4],[[0,0,1,0,0,-2],2],[[0,0,1,0,0,0],2],[[0,1,0,0,0,-2],1],[[0,1,0,0,0,0],1],[[1,0,0,0,0,-2],1]],"forced":30,"conflicts":[{"mask":6,"lambda_":[-1,1]},{"mask":24,"lambda_":[-1,1]},{"mask":96,"lambda_":[-1,1]}],"witness":["2","2","2","2","0"],"minimum":37,"unsplit_minimum":38,"unsplit_schedules":24,"feasible_subsets":108,"schedule":{"0":[[0,"1"]],"1":[[0,"1"]],"3":[[1,"2"],[5,"-1"]],"7":[[3,"1"]]}}, +{"column":83,"variables":[[0,3],[5,1],[5,2],[5,3]],"groups":[[[0,0,0,1,0],1],[[0,0,1,0,0],1],[[0,1,0,0,0],1],[[1,0,0,0,-2],1],[[1,0,0,0,0],1]],"forced":43,"conflicts":[{"mask":24,"lambda_":[-1,1]}],"witness":["2","0","0","0"],"minimum":44,"unsplit_minimum":44,"unsplit_schedules":16,"feasible_subsets":24,"schedule":{"0":[[2,"2"],[3,"-1"]],"1":[[0,"1"]],"3":[[0,"1"]],"4":[[0,"1"]],"5":[[3,"1"]]}}, +{"column":84,"variables":[[4,1],[4,3]],"groups":[[[0,1,-2],1],[[0,1,0],1],[[1,0,-2],1]],"forced":45,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":16,"feasible_subsets":6,"schedule":{"0":[[1,"1"]],"1":[[0,"1"]],"2":[[1,"1"]],"4":[[0,"2"],[1,"-2"],[2,"2"],[3,"-1"]],"7":[[0,"1"]]}}, +{"column":85,"variables":[[6,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":2,"feasible_subsets":2,"schedule":{"0":[[0,"1"]],"6":[[1,"1"]]}}, +{"column":86,"variables":[[1,2],[6,1]],"groups":[[[0,1,-2],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"1":[[2,"1"]],"5":[[0,"1"]],"6":[[0,"2"],[1,"-1"]]}}, +{"column":87,"variables":[[4,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":3,"feasible_subsets":2,"schedule":{"4":[[2,"1"]],"5":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":88,"variables":[[2,4]],"groups":[[[1,-2],2],[[1,0],2]],"forced":44,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["2"],"minimum":46,"unsplit_minimum":46,"unsplit_schedules":5,"feasible_subsets":3,"schedule":{"2":[[3,"2"],[4,"-1"]],"3":[[0,"1"]],"4":[[0,"1"]]}}, +{"column":89,"variables":[[1,2],[6,1]],"groups":[[[0,1,0],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","0"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":24,"feasible_subsets":4,"schedule":{"1":[[1,"2"],[2,"-1"]],"3":[[1,"1"]],"6":[[1,"1"]],"7":[[1,"1"]]}}, +{"column":90,"variables":[[5,1],[5,2],[6,1]],"groups":[[[0,0,1,-2],1],[[0,1,0,-2],1],[[1,0,0,-2],1]],"forced":45,"conflicts":[],"witness":["2","2","2"],"minimum":45,"unsplit_minimum":48,"unsplit_schedules":12,"feasible_subsets":8,"schedule":{"0":[[1,"1"]],"3":[[0,"1"]],"5":[[0,"2"],[2,"-1"]],"6":[[0,"2"],[1,"-1"]],"7":[[0,"1"]]}}, +{"column":91,"variables":[[3,2],[7,3]],"groups":[[[0,1,-2],3],[[1,0,0],1]],"forced":44,"conflicts":[],"witness":["0","2"],"minimum":44,"unsplit_minimum":47,"unsplit_schedules":36,"feasible_subsets":4,"schedule":{"2":[[2,"1"]],"3":[[2,"1"]],"5":[[0,"1"]],"7":[[2,"2"],[3,"-1"]]}}, +{"column":92,"variables":[[4,1],[4,3],[4,4],[6,1]],"groups":[[[0,0,1,0,-2],1],[[0,0,1,0,0],4],[[0,0,1,1,-1],1],[[0,1,0,0,0],2],[[1,0,0,0,0],1]],"forced":39,"conflicts":[{"mask":3,"lambda_":[-1,1]}],"witness":["0","0","0","1"],"minimum":40,"unsplit_minimum":40,"unsplit_schedules":20,"feasible_subsets":24,"schedule":{"1":[[1,"1"]],"3":[[0,"1"]],"4":[[4,"1"]],"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":93,"variables":[[4,1],[6,1]],"groups":[[[0,1,-2],1],[[1,0,0],1]],"forced":46,"conflicts":[],"witness":["0","2"],"minimum":46,"unsplit_minimum":47,"unsplit_schedules":8,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"3":[[1,"1"]],"4":[[1,"1"]],"6":[[0,"2"],[1,"-1"]]}}, +{"column":94,"variables":[[6,1]],"groups":[[[1,0],1]],"forced":47,"conflicts":[],"witness":["0"],"minimum":47,"unsplit_minimum":47,"unsplit_schedules":4,"feasible_subsets":2,"schedule":{"1":[[1,"1"]],"2":[[0,"1"]],"4":[[0,"1"]],"6":[[1,"1"]],"7":[[0,"1"]]}}, +{"column":95,"variables":[[5,1],[6,1]],"groups":[[[0,1,-2],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","2"],"minimum":46,"unsplit_minimum":48,"unsplit_schedules":8,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"4":[[0,"1"]],"5":[[0,"2"],[1,"-1"]],"6":[[0,"2"],[1,"-1"]],"7":[[1,"1"]]}}, +{"column":96,"variables":[[4,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":18,"feasible_subsets":2,"schedule":{"0":[[2,"1"]],"2":[[0,"1"]],"4":[[0,"2"],[1,"-1"]],"7":[[2,"1"]]}}, +{"column":97,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"1":[[0,"1"]],"2":[[0,"1"]],"4":[[0,"1"]],"7":[[0,"1"]]}}, +{"column":98,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":2,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"3":[[0,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":99,"variables":[[6,1],[6,2]],"groups":[[[0,1,-2],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","2"],"minimum":46,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"0":[[1,"1"]],"1":[[0,"1"]],"4":[[0,"1"]],"6":[[0,"2"],[2,"-1"]]}}, +{"column":100,"variables":[[4,1]],"groups":[[[1,-2],1]],"forced":47,"conflicts":[],"witness":["2"],"minimum":47,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":2,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"4":[[0,"2"],[1,"-2"],[2,"1"]],"6":[[0,"1"]],"7":[[1,"1"]]}}, +{"column":101,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"5":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":102,"variables":[],"groups":[],"forced":48,"conflicts":[],"witness":[],"minimum":48,"unsplit_minimum":48,"unsplit_schedules":1,"feasible_subsets":1,"schedule":{"0":[[0,"1"]],"2":[[0,"1"]],"4":[[0,"1"]],"6":[[0,"1"]]}}, +{"column":103,"variables":[[6,1],[6,2]],"groups":[[[0,1,-2],1],[[1,0,-2],1]],"forced":46,"conflicts":[],"witness":["2","2"],"minimum":46,"unsplit_minimum":48,"unsplit_schedules":6,"feasible_subsets":4,"schedule":{"0":[[0,"1"]],"1":[[1,"1"]],"5":[[0,"1"]],"6":[[0,"2"],[2,"-1"]]}} +] diff --git a/research/p104-fixed-flag-split-optimum/SOURCE-PINS.json b/research/p104-fixed-flag-split-optimum/SOURCE-PINS.json new file mode 100644 index 0000000000..d918c47236 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/SOURCE-PINS.json @@ -0,0 +1,53 @@ +{ + "schema_version": 1, + "sources": [ + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/README.md", + "retained": "retained/source7748/README.md", + "git_blob": "ecfb216abff2273a136315dce620aed4088533f2", + "sha256": "72c57c566f96e7a062416b12d46e153af66345a579518167563befe7b45ce00b" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/SOURCES.json", + "retained": "retained/source7748/SOURCES.json", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/TASK.json", + "retained": "retained/source7748/TASK.json", + "git_blob": "4b211a33b19d6397357ac7a81dcff62c3318df6c", + "sha256": "2121a522314d64507f1589ee8866872bf35d1c60324ef51b9b6bfa4172e50667" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/VERIFY.json", + "retained": "retained/source7748/VERIFY.json", + "git_blob": "a2dd711b937551b3e59e3bcbf64d6bdfe67c55f6", + "sha256": "051173e928a6bd20a131b152c41d10228f8c17c41c6fde301e5bb18fb64eb5c3" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/WITNESS.json", + "retained": "retained/source7748/WITNESS.json", + "git_blob": "ec9b78d4d8a7aadd54d2350a404e41cd86a292c9", + "sha256": "7d5f26b695e0517a188355a19c2a270668ffb7cc871b43e54886f4e7988ae696" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e", + "path": "research/p104-c56-split-gather-witness/verify.py", + "retained": "retained/source7748/verify.py", + "git_blob": "4dc7787c3e73c578ef753ba3438dcafbfb907163", + "sha256": "995de48652dcf4d4fb4255e6be5f37c6573cad4daaedd32304b7aa85b8c5776b" + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/SOURCES.json b/research/p104-fixed-flag-split-optimum/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/SOURCES.json @@ -0,0 +1,18 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/TASK.json b/research/p104-fixed-flag-split-optimum/TASK.json new file mode 100644 index 0000000000..0442557e8b --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/TASK.json @@ -0,0 +1,123 @@ +{ + "schema_version": 1, + "task_id": "p104-side-correction", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "p104-side-correction", + "question": "Can joint helper bases and a legal causal split improve the complete P104 productive/paid invoice?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "research/p104-helper-subspace-splits/README.md", + "research/dyadic-helper-channel-capacity/README.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "An exact arbitrary-input identity, source/target frame availability and restoration at the chosen cut, plus the complete channel+correction+idle/hosting bill or an explicit favorable bound. The native channel alone is not a supplier. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Start with the selected #5599 emitted word and review pending #5718 distinct input/output bases plus #5717/#5719 coverage before claiming work. Pick one uncovered source word, helper group and cut region. Prove the arbitrary-input relation and legal entry/exit corrections, then compare full target and paid profiles. Reject if completion, owned lifetimes or consumer costs repay the gain. A static pairing rank alone is not a physical split.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "P104", + "helper basis", + "helper split", + "5718", + "dyadic capacity" + ], + "existing_checks": [ + { + "scope": "PR #4133: literal-slot defect", + "evidence": "research/p104-literal-slot-defect/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "88666f1dee93fbd85b31fd5d6f91a219e111b5f4", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4136: uniform commutation gap", + "evidence": "research/p104-uniform-commutation-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "281ce601a8be9db470de630759179c23e1dfaa88", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4140: uniform encoding gap", + "evidence": "research/p104-uniform-encoding-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "de25c6525aa866962309df5d107b32d55e6e5628", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4153: source-chart shortcut exhausts its optimistic allowance", + "evidence": "research/p104-source-chart-shortcut/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "9123241fea53df77e51ffe30d9aca1625d4bf3a8", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4154: fiber-tag seam mismatch", + "evidence": "research/p104-fiber-tag-seam/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "4ffcdaee5d6255a9cea1fe53a5424435068089d0", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "All 104 columns of the PR7748 fixed eight flags, one read per chain and arbitrary rational legal gather pieces with total one on each active chain.", + "scope_change_reason": "Resolve the released fixed-flag signed-prefix question with an exact optimum, distinct from active helper and endpoint-read searches.", + "bottleneck_link": "Quantify the exact benefit and limit of split gathers on a concrete formal decoder before any native construction expansion.", + "budget_minutes": 60, + "stop_rule": "Stop at a matching exact bound and full schedule, or a precise unresolved column domain; do not infer global flag or physical optimality.", + "outcome": "completed", + "evidence": "PROOF.md and RESULT.json give exact 4745 and 4814 optima, 23 contradiction certificates, all 1400 subset comparisons and a full schedule.", + "author": "Ali Romman", + "ai_assistance": "Substantial OpenAI Codex assistance in research, implementation, verification and writing", + "open_questions": [ + { + "question": "Can low-junk flags improve with rational splits?", + "why_it_matters": "These fixed flags remain worse than the reported global witness.", + "first_step": "Pin an available low-junk flag witness and form its exact prefix equations.", + "blocked_by": "A matching low-junk witness and its source-bound proof are needed." + }, + { + "question": "Can the extra gather pieces give a paid gain?", + "why_it_matters": "The witness uses 74 extra pieces, whose physical cost is not zero.", + "first_step": "Specify a native carrier and charge each piece, movement and restoration.", + "blocked_by": "No complete paid caller invoice is supplied." + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/VERIFY.json b/research/p104-fixed-flag-split-optimum/VERIFY.json new file mode 100644 index 0000000000..2783280f32 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Authenticate the fixed flags; check all affine entries, integer contradictions, exact subset elimination, matching schedules, single-gather optima, rational samples and fault controls." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Authenticate the fixed flags; check all affine entries, integer contradictions, exact subset elimination, matching schedules, single-gather optima, rational samples and fault controls." + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/README.md b/research/p104-fixed-flag-split-optimum/retained/source7748/README.md new file mode 100644 index 0000000000..ecfb216abf --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/README.md @@ -0,0 +1,97 @@ +# A signed split gather reduces P104 flag junk + +**Finite certificate.** On source column 4 of one fixed eight-flag `C=56` +configuration, the exact single-gather minimum is **45 even off-diagonal +nonzeros**. A signed split gather at levels 0 and 4 leaves **44**. The split +preserves the nonzero diagonal and every required odd off-diagonal zero. + +## Model and witness + +As in PR #7689, chain `k` has virtual endpoints `z_k, z'_k` and a complete +binary flag from the line spanned by `z'_k` to the perpendicular space of +`z_k`. Write `tau_k(t)` for the first flag level containing port `t` and +`sigma_k(s)` for the last level perpendicular to port `s`. A gather at +level `g` is legal if `0 <= g <= sigma_k(s)`. With one read, the coefficient +on row `t` and source `s` is + +```text + G[t,z_k] G[s,z'_k] +sum over k ----------------- sum of gather pieces at levels g < tau_k(t). + G[z_k,z'_k] +``` + +For an active chain, the pieces sum to one. A single gather puts coefficient +one at one legal level. The signed extension allows rational pieces with the +same total. If the binary port labels have dot product one, then `t` cannot +enter the flag while `s` is still perpendicular to it. All legal pieces +contribute to that entry. The odd off-diagonal entries and the diagonal +therefore depend only on the terminal coefficient one. + +The five active chains in column 4 are `0, 2, 3, 5, 6` in zero-based indices. +Their maximum gather levels are `0, 0, 4, 0, 1`. Exactly two of the ten +single-gather schedules leave 45 junk entries, two leave 47 and six leave 48. +One attaining schedule gathers at `(0,0,4,0,0)`. It suffices to change chain +3, whose virtual labels are 448 and 52. Gather `+2` at level 0 and `-1` at +level 4. Rows 0, 1, 50 and 56 become zero and rows 35, 86 and 90 become +nonzero. All other entries in the column stay fixed. + +The checker embeds the split in a complete schedule and checks 104 diagonal +entries equal to 2 and all 5,720 required odd off-diagonal zeros. Since the +formal gather choices are independent by column, this split can also replace +column 4 of a full single-gather optimum for these same flags. The comparison +is with those fixed flags. The best split value, the optimum over all flag +choices, and the physical cost of the extra gather remain open. No selected +multiplication bound follows. + +## Reproduce + +From the repository root, using CPython 3.12.15 and the standard library: + +```sh +python3.12 -B scripts/research_package.py --package research/p104-c56-split-gather-witness +python3.12 -B scripts/check_research_commit.py --package research/p104-c56-split-gather-witness --check-source-history +python3.12 -I -W error -B research/p104-c56-split-gather-witness/verify.py +python3.12 -I -O -W error -B research/p104-c56-split-gather-witness/verify.py +``` + +The verifier prints `PASS_P104_C56_SPLIT_GATHER_WITNESS`, the exact histogram +of the ten unsplit schedules and the split count. It rejects a misplaced +piece and a wrong total coefficient. + +[WITNESS.json](WITNESS.json) holds the ordered labels, one eight-entry Gram profile +per line, chain pairs, flag bases and signed gather. The Gram profiles are the +inner products against the eight listed basis ports. If `H` is the Gram +matrix of the basis and `p_a` is a column of eight products for line `a`, +then `p_a^T H^-1 p_b` gives the full Gram entry. The verifier uses exact +rationals and matches the reconstructed 104-port Gram and labels to the +SHA-256 hashes of the source files. It checks the virtual-line entries against +the binary labels and reconstructs each flag. Replay has no network or +third-party dependency. + +## Open next questions + +- Can signed gathers decrease the best junk count over the admissible flags? + Start by fixing flags from a low-junk single-gather witness and solving the + per-column zero equations for signed prefix coefficients. A gain on the + flags here gives no bound for the best flags in either model. +- Can a paid native gather implement the extra signed piece and its + restoration at a cost below the removed junk? The fixed-flag calculation + leaves the actual transport, storage and recursive prices open. + +## Credit + +This result was produced by Nick Petalas. Credit DreamingOfClouds for the +`C=56` model, the first eligible chain configuration and its geometry, and +for identifying split gathers as outside the prior bound. +[PR #7689](https://github.com/CrocSwap/integer-mult-bounds/pull/7689) + +Source head `511e7d0852acdca291b50c538b978fb063ae7bac`, directory +`research/p104-c56-class-ceiling/certificate/`. The basis profiles use the +source `geo.py` ordering and its files `data/G104.npy`, `data/lines104.json` +and `data/f1cfgs.pkl`. The geometry program `geo.py` and configuration list +`data/f1cfgs.pkl` have SHA-256 values +`d907a68eaa8362d77ad7a0600ce8c6c0592397f8817ffa82de3675658f65632e` +and `3a65c5101058c283b72407ad4bbe116e2154cc760c63b524026f3f84012888f4`. +[Source tree](https://github.com/DreamingOfClouds/integer-mult-bounds/tree/511e7d0852acdca291b50c538b978fb063ae7bac/research/p104-c56-class-ceiling/certificate) + +Apache-2.0. diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/SOURCES.json b/research/p104-fixed-flag-split-optimum/retained/source7748/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/SOURCES.json @@ -0,0 +1,18 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/TASK.json b/research/p104-fixed-flag-split-optimum/retained/source7748/TASK.json new file mode 100644 index 0000000000..4b211a33b1 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/TASK.json @@ -0,0 +1,123 @@ +{ + "schema_version": 1, + "task_id": "p104-side-correction", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "p104-side-correction", + "question": "Can joint helper bases and a legal causal split improve the complete P104 productive/paid invoice?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "research/p104-helper-subspace-splits/README.md", + "research/dyadic-helper-channel-capacity/README.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "An exact arbitrary-input identity, source/target frame availability and restoration at the chosen cut, plus the complete channel+correction+idle/hosting bill or an explicit favorable bound. The native channel alone is not a supplier. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Start with the selected #5599 emitted word and review pending #5718 distinct input/output bases plus #5717/#5719 coverage before claiming work. Pick one uncovered source word, helper group and cut region. Prove the arbitrary-input relation and legal entry/exit corrections, then compare full target and paid profiles. Reject if completion, owned lifetimes or consumer costs repay the gain. A static pairing rank alone is not a physical split.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "P104", + "helper basis", + "helper split", + "5718", + "dyadic capacity" + ], + "existing_checks": [ + { + "scope": "PR #4133: literal-slot defect", + "evidence": "research/p104-literal-slot-defect/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "88666f1dee93fbd85b31fd5d6f91a219e111b5f4", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4136: uniform commutation gap", + "evidence": "research/p104-uniform-commutation-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "281ce601a8be9db470de630759179c23e1dfaa88", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4140: uniform encoding gap", + "evidence": "research/p104-uniform-encoding-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "de25c6525aa866962309df5d107b32d55e6e5628", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4153: source-chart shortcut exhausts its optimistic allowance", + "evidence": "research/p104-source-chart-shortcut/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "9123241fea53df77e51ffe30d9aca1625d4bf3a8", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4154: fiber-tag seam mismatch", + "evidence": "research/p104-fiber-tag-seam/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "4ffcdaee5d6255a9cea1fe53a5424435068089d0", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Compare signed split and single gathers in source column 4 of one fixed eight-flag P104 C=56 configuration.", + "scope_change_reason": "PR #7689 leaves split gathers outside its lower bound. This finite decoder comparison precedes the card's physical P104 caller and invoice.", + "bottleneck_link": "A split can trade an extra gather for fewer junk entries in a named P104 model. Its paid implementation remains open.", + "budget_minutes": 60, + "stop_rule": "Package the first strict fixed-flag improvement after enumerating all unsplit alternatives and checking required entries.", + "outcome": "completed", + "evidence": "Finite certificate. The single-gather minimum is 45 across ten schedules for column 4. One signed split gives 44. Full schedule replay checks 104 diagonals and 5720 odd off-diagonal zeros. CPython 3.12.15.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can signed pieces decrease the best junk count over the admissible flags?", + "why_it_matters": "The current witness compares schedules with identical flags.", + "first_step": "Fix flags from a low-junk single-gather witness and solve the column zero equations for signed prefix coefficients.", + "blocked_by": "The admissible best flags and split optimum remain open." + }, + { + "question": "Can the extra signed piece cost less than the removed junk?", + "why_it_matters": "Only a favorable complete bill can improve the supplier.", + "first_step": "Price the two gathers and their restoration on a fixed carrier for the witness.", + "blocked_by": "The paid native gather, transport and storage are unpriced." + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/VERIFY.json b/research/p104-fixed-flag-split-optimum/retained/source7748/VERIFY.json new file mode 100644 index 0000000000..a2dd711b93 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 30, + "checks": "Exact fixed-flag comparison, full required entries, and invalid split controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 30, + "checks": "Exact fixed-flag comparison, full required entries, and invalid split controls." + } + ] +} diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/WITNESS.json b/research/p104-fixed-flag-split-optimum/retained/source7748/WITNESS.json new file mode 100644 index 0000000000..ec9b78d4d8 --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/WITNESS.json @@ -0,0 +1,139 @@ +{ + "basis_rows": [0, 1, 2, 3, 4, 5, 8, 11], + "labels": [11, 19, 35, 131, 259, 13, 21, 37, 69, 133, 261, 41, 73, 265, 49, 145, 161, 193, 321, 385, 14, 22, 38, 70, 134, 26, 74, 138, 50, 146, 274, 194, 322, 386, 28, 44, 140, 84, 148, 276, 100, 292, 196, 324, 388, 56, 88, 152, 168, 296, 200, 328, 392, 112, 176, 304, 208, 336, 400, 224, 352, 416, 508, 506, 502, 494, 478, 446, 382, 254, 505, 501, 493, 477, 445, 381, 253, 499, 475, 443, 379, 251, 487, 471, 439, 375, 247, 463, 431, 367, 239, 415, 351, 223, 319, 191, 81, 98, 164, 262, 268, 273, 280, 290, 42, 266, 25, 137, 7, 67, 448, 104, 76, 82, 162, 97, 289, 127, 52, 491], + "gram_profiles": [ + [2, -1, -1, 1, 1, -1, 0, 1], + [-1, 2, 1, -1, -1, 0, 0, 0], + [-1, 1, 2, -1, -1, 0, 0, -1], + [1, -1, -1, 2, 1, 0, 0, 0], + [1, -1, -1, 1, 2, 0, 0, 0], + [-1, 0, 0, 0, 0, 2, 1, -1], + [0, 1, 0, 0, 0, 1, 1, 0], + [0, 0, 1, 0, 0, 1, 1, -1], + [0, 0, 0, 0, 0, 1, 2, 0], + [0, 0, 0, 1, 0, -1, -1, 0], + [0, 0, 0, 0, 1, -1, -1, 0], + [1, 0, -1, 0, 0, -1, 0, 2], + [-1, 0, 0, 0, 0, 1, 1, -1], + [-1, 0, 0, 0, -1, 1, 0, -1], + [0, -1, -1, 0, 0, 0, 0, 1], + [0, 1, 0, -1, 0, 0, 0, 0], + [0, 0, -1, 1, 0, 0, 0, 1], + [0, 0, 0, -1, 0, 0, 1, 0], + [0, 0, 0, 0, -1, 0, 1, 0], + [0, 0, 0, -1, -1, 0, 0, 0], + [-1, 0, 0, 0, 0, 1, 0, 0], + [0, -1, 0, 0, 0, 0, 0, -1], + [0, 0, -1, 0, 0, 0, 0, 0], + [0, 0, 0, 0, 0, 0, -1, -1], + [0, 0, 0, 1, 0, 0, 0, -1], + [-1, 1, 0, 0, 0, 0, -1, 0], + [1, 0, 0, 0, 0, 0, 0, 0], + [1, 0, 0, 1, 0, 0, 1, 0], + [0, -1, -1, 0, 0, 1, 1, 0], + [0, 1, 0, -1, 0, -1, -1, 1], + [0, -1, 0, 0, 1, 1, 1, -1], + [0, 0, 0, -1, 0, -1, 0, 1], + [0, 0, 0, 0, -1, -1, 0, 1], + [0, 0, 0, -1, -1, -1, -1, 1], + [0, 0, 1, -1, -1, -1, 0, 0], + [0, 1, 0, -1, -1, -1, 0, 1], + [0, -1, -1, 0, 1, 1, 0, 0], + [-1, 0, 1, -1, -1, 0, -1, -1], + [-1, 0, 1, 0, -1, 0, 0, -1], + [-1, 0, 1, -1, 0, 0, 0, -1], + [1, -1, 0, 1, 1, 0, 1, 0], + [1, -1, 0, 1, 0, 0, 0, 0], + [1, -1, -1, 0, 1, 0, 1, 1], + [-1, 1, 1, -1, 0, 0, -1, -1], + [1, -1, -1, 0, 0, 0, 0, 1], + [0, 0, 0, -1, -1, 0, 1, 1], + [0, 0, 1, -1, -1, 0, 0, 0], + [0, 0, 1, 0, -1, 0, 1, 0], + [0, -1, 0, 0, 1, 0, -1, -1], + [0, -1, 0, 1, 0, 0, -1, -1], + [0, 1, 1, 0, -1, 0, 0, 0], + [0, 1, 1, -1, 0, 0, 0, 0], + [0, 1, 1, 0, 0, 0, 1, 0], + [-1, 0, 0, -1, -1, 1, 0, 0], + [1, 0, 0, 0, 1, -1, -1, 0], + [1, 0, 0, 1, 0, -1, -1, 0], + [1, 0, -1, 0, 1, -1, 0, 1], + [1, 0, -1, 1, 0, -1, 0, 1], + [1, 0, -1, 0, 0, -1, -1, 1], + [1, -1, 0, 0, 1, -1, 0, 0], + [1, -1, 0, 1, 0, -1, 0, 0], + [-1, 1, 0, 0, 0, 1, 1, 0], + [0, 0, 0, 0, 0, 1, 1, -1], + [1, -1, -1, 1, 1, 0, 0, 1], + [0, -1, -1, 1, 1, 0, -1, 0], + [1, 0, -1, 1, 1, -1, -1, 1], + [1, -1, 0, 1, 1, -1, -1, 0], + [1, -1, -1, 1, 1, -1, 0, 1], + [-1, 1, 1, 0, -1, 1, 1, -1], + [1, -1, -1, 1, 0, -1, -1, 1], + [1, -1, -1, 1, 1, 1, 1, 0], + [0, 1, 1, -1, -1, -1, 0, 1], + [-1, 0, 1, -1, -1, 0, 0, 0], + [-1, 1, 0, -1, -1, 0, 0, 1], + [-1, 1, 1, -1, -1, 0, -1, 0], + [-1, 1, 1, 0, -1, 0, 0, 0], + [1, -1, -1, 1, 0, 0, 0, 0], + [1, 0, 0, 0, 0, 0, 1, 1], + [0, 0, 1, 0, 0, -1, -1, -1], + [0, 0, 0, 0, 0, 1, 0, 0], + [0, 0, 0, -1, 0, -1, -1, 0], + [0, 0, 0, 0, 1, 1, 1, 0], + [1, 1, 0, 0, 0, -1, 0, 1], + [1, 0, 1, 0, 0, -1, 0, 0], + [-1, 0, 0, 0, 0, 1, -1, -1], + [1, 0, 0, -1, 0, -1, 0, 1], + [-1, 0, 0, 0, 1, 1, 0, -1], + [0, 1, -1, 0, 0, 0, 0, 1], + [0, 1, 0, 0, 0, 0, -1, 0], + [0, 1, 0, 1, 0, 0, 0, 0], + [0, 1, 0, 0, 1, 0, 0, 0], + [0, 0, 1, 0, 0, 0, -1, -1], + [0, 0, -1, -1, 0, 0, 0, 1], + [0, 0, 1, 0, 1, 0, 0, -1], + [0, 0, 0, -1, 0, 0, -1, 0], + [0, 0, 0, 0, -1, 0, -1, 0], + [0, 1, 0, 0, 0, 0, 1, 0], + [0, 0, 1, 0, 0, -1, 0, 0], + [1, -1, 0, 0, 1, 0, 0, 0], + [0, 0, 0, 0, 1, 0, 0, -1], + [0, 1, 1, -1, 0, -1, 0, 0], + [0, 1, 0, 0, -1, 0, 0, 0], + [0, 0, 1, -1, 0, 0, 1, 0], + [0, 0, 1, 0, -1, -1, -1, 0], + [-1, 0, 1, 0, 0, 0, -1, -1], + [-1, 0, 0, 0, -1, 0, -1, 0], + [1, -1, 0, 0, 0, -1, 0, 1], + [1, 0, 0, 1, 0, -1, 0, 1], + [-1, 1, 1, -1, -1, 1, 1, 0], + [1, -1, -1, 1, 1, 0, -1, 0], + [1, -1, -1, 0, 0, -1, 0, 1], + [0, 1, 0, -1, -1, 0, 0, 1], + [0, -1, -1, 1, 1, 1, 1, 0], + [0, 1, 0, 0, 0, -1, 0, 1], + [0, 0, -1, 1, 0, 1, 1, 0], + [0, 0, -1, 0, 0, 0, -1, 1], + [0, 0, 1, 0, -1, 0, 0, -1], + [0, 0, 0, -1, 1, 0, 0, 0], + [1, 0, 0, 1, 1, 0, 0, 0], + [0, -1, 0, 0, 0, 1, 1, 0] + ], + "chains": [[104, 105], [106, 107], [108, 109], [110, 118], [111, 115], [112, 116], [114, 117], [119, 113]], + "flag_bases": [ + [266, 105, 424, 419, 145, 276, 207, 185], + [137, 122, 147, 301, 152, 305, 60, 442], + [67, 387, 142, 491, 216, 128, 200, 19], + [52, 341, 389, 362, 252, 428, 23, 56], + [97, 44, 299, 117, 386, 204, 168, 171], + [289, 268, 487, 415, 503, 360, 258, 486], + [127, 509, 126, 383, 25, 236, 198, 415], + [82, 205, 287, 226, 505, 54, 398, 428] + ], + "source_column": 4, + "split_schedule": [[0, [[0, 1]]], [2, [[0, 1]]], [3, [[0, 2], [4, -1]]], [5, [[0, 1]]], [6, [[0, 1]]]] +} diff --git a/research/p104-fixed-flag-split-optimum/retained/source7748/verify.py b/research/p104-fixed-flag-split-optimum/retained/source7748/verify.py new file mode 100644 index 0000000000..4dc7787c3e --- /dev/null +++ b/research/p104-fixed-flag-split-optimum/retained/source7748/verify.py @@ -0,0 +1,207 @@ +#!/usr/bin/env python3 +"""Replay the fixed-flag single-gather minimum and the signed split witness.""" + +from collections import Counter +from fractions import Fraction +from hashlib import sha256 +from itertools import product +import json +from pathlib import Path +from struct import pack + + +PORTS = range(104) +LINES = range(120) +CHAINS = range(8) +PORT_GRAM_SHA256 = "98339059a79361ca365325f872860f6ab5b3de87bf998c2957ecf240577f2c4a" +PORT_LABEL_SHA256 = "d7fc071c93a88a7746f545ba215da98c8be2de16ded9e3f884e48134a3d24fa6" +NPY_HEADER = b"{'descr': ' deadlines[k][column]) + row = tuple(weights[k][column][t] if arrivals[k][t] == j else 0 + for k, j in variables) + (constant,) + forms.append(row) + if t == column or s.dot(labels[t], labels[column]): + require(not any(row[:-1]) and row[-1] == (2 if t == column else 0), + 'required entry depends on a free prefix') + elif not any(row[:-1]): + forced += bool(row[-1]) + else: + divisor = gcd(*row) + normalized = tuple(x // divisor for x in row) + if next(x for x in normalized if x) < 0: + normalized = tuple(-x for x in normalized) + groups[normalized] += 1 + return active, variables, forms, sorted(groups.items()), forced + + +def solve(rows, dimension): + """Return one rational solution, or None for an inconsistent system.""" + matrix = [list(map(Fraction, row)) for row in rows] + pivot_rows = [] + for column in range(dimension): + level = len(pivot_rows) + pivot = next((i for i in range(level, len(matrix)) if matrix[i][column]), None) + if pivot is None: + continue + matrix[level], matrix[pivot] = matrix[pivot], matrix[level] + value = matrix[level][column] + matrix[level] = [x / value for x in matrix[level]] + for i in range(len(matrix)): + if i != level: + factor = matrix[i][column] + matrix[i] = [x - factor * y for x, y in zip(matrix[i], matrix[level], strict=True)] + pivot_rows.append(column) + if any(not any(row[:-1]) and row[-1] for row in matrix): + return None + answer = [Fraction(0)] * dimension + for i, column in enumerate(pivot_rows): + answer[column] = -matrix[i][-1] + return answer + + +def conflict_bound(groups, conflicts): + """Use integer contradiction certificates and finite subset coverage.""" + masks = [] + for conflict in conflicts: + mask = conflict['mask'] + require(type(mask) is int and 0 < mask < 1 << len(groups), 'conflict mask') + indices = [i for i in range(len(groups)) if mask >> i & 1] + multipliers = conflict['lambda_'] + require(len(indices) == len(multipliers) and + all(type(x) is int and x for x in multipliers), 'conflict coefficients') + combination = [sum(a * groups[i][0][j] for a, i in zip(multipliers, indices, strict=True)) + for j in range(len(groups[0][0]))] + require(not any(combination[:-1]) and combination[-1] != 0, 'false contradiction') + masks.append(mask) + require(len(set(masks)) == len(masks), 'duplicate conflict') + feasible = [] + for mask in range(1 << len(groups)): + if not any(mask & bad == bad for bad in masks): + feasible.append(mask) + maximum = max(sum(weight for i, (_, weight) in enumerate(groups) if mask >> i & 1) + for mask in feasible) + return sum(weight for _, weight in groups) - maximum, set(feasible) + + +def schedule_from_prefixes(variables, values, active, deadlines, column): + chosen = dict(zip(variables, values, strict=True)) + schedule = {} + for k in active: + limit = deadlines[k][column] + cumulative = [Fraction(0)] + for j in range(1, limit + 1): + cumulative.append(chosen.get((k, j), Fraction(0))) + cumulative.append(Fraction(1)) + schedule[k] = [(j, cumulative[j + 1] - cumulative[j]) for j in range(limit + 1) + if cumulative[j + 1] != cumulative[j]] + return schedule + + +def direct_column(schedule, column, arrivals, weights): + """Accumulate each individual gather into every later reader.""" + output = [Fraction(0)] * 104 + for k, pieces in schedule.items(): + for level, amount in pieces: + for t in range(104): + if arrivals[k][t] > level: + output[t] += amount * weights[k][column][t] + return output + + +def reject(call, message): + try: + call() + except ValueError as error: + require(str(error) == message, 'wrong rejection') + else: + raise ValueError('fault passed') + + +def verify(): + s = source_module() + data = json.loads((ROOT / 'retained/source7748/WITNESS.json').read_text()) + labels = data['labels'] + gram = s.reconstruct_gram(data) + arrivals, deadlines, weights = s.model(data, gram) + certificate = json.loads((ROOT / 'RESULT.json').read_text()) + require([r['column'] for r in certificate] == list(range(104)), 'column coverage') + totals = Counter() + models = [] + for row in certificate: + column = row['column'] + active, variables, forms, groups, forced = affine_column( + s, labels, arrivals, deadlines, weights, column) + require(row['variables'] == [list(v) for v in variables] and + row['groups'] == [[list(form), weight] for form, weight in groups] and + row['forced'] == forced, 'affine certificate') + extra, consistent_masks = conflict_bound(groups, row['conflicts']) + require(row['minimum'] == forced + extra, 'minimum bound') + linear_masks = set() + for mask in range(1 << len(groups)): + selected = [form for i, (form, _) in enumerate(groups) if mask >> i & 1] + if solve(selected, len(variables)) is not None: + linear_masks.add(mask) + require(linear_masks == consistent_masks and len(linear_masks) == row['feasible_subsets'], + 'independent subset elimination') + values = list(map(Fraction, row['witness'])) + schedule = schedule_from_prefixes(variables, values, active, deadlines, column) + serialized = {str(k): [[j, str(v)] for j, v in pieces] for k, pieces in schedule.items()} + require(serialized == row['schedule'], 'schedule certificate') + output = s.run_column(column, schedule, arrivals, deadlines, weights) + require(output == direct_column(schedule, column, arrivals, weights), 'direct piece replay') + require(output == [sum(a * b for a, b in zip(form[:-1], values, strict=True)) + form[-1] + for form in forms], 'affine replay') + totals['odd'] += s.check_required_entries(column, output, labels) + require(s.junk(column, output, labels) == row['minimum'], 'matching optimum witness') + singles = [] + for levels in product(*(range(deadlines[k][column] + 1) for k in active)): + single = {k: [(level, 1)] for k, level in zip(active, levels, strict=True)} + output = s.run_column(column, single, arrivals, deadlines, weights) + s.check_required_entries(column, output, labels) + singles.append(s.junk(column, output, labels)) + require(len(singles) == row['unsplit_schedules'] and min(singles) == row['unsplit_minimum'], + 'single-gather optimum') + for numerator, denominator in [(-3, 2), (1, 3), (5, 2), (7, 3)]: + trial = [Fraction(numerator + i, denominator) for i in range(len(variables))] + pieces = schedule_from_prefixes(variables, trial, active, deadlines, column) + output = direct_column(pieces, column, arrivals, weights) + require(output == s.run_column(column, pieces, arrivals, deadlines, weights), + 'rational source replay') + require(output == [sum(a * b for a, b in zip(form[:-1], trial, strict=True)) + form[-1] + for form in forms], 'rational affine replay') + for key, value in dict(minimum=row['minimum'], unsplit=row['unsplit_minimum'], + forced=forced, subsets=1 << len(groups), + conflicts=len(row['conflicts']), singles=len(singles), + active=len(active), pieces=sum(len(v) for v in schedule.values()), + improved=int(row['minimum'] < row['unsplit_minimum'])).items(): + totals[key] += value + models.append((variables, groups, active)) + expected = dict(odd=5720, minimum=4745, unsplit=4814, forced=4715, subsets=1400, + conflicts=23, singles=1242, active=416, pieces=490, improved=44) + require(dict(totals) == expected, 'global totals') + variables, groups, active = models[4] + require(certificate[4]['minimum'] == 43 and certificate[4]['unsplit_minimum'] == 45, + 'source column optimum') + broken = deepcopy(certificate[4]['conflicts']) + broken[0]['lambda_'][0] *= -1 + reject(lambda: conflict_bound(groups, broken), 'false contradiction') + missing = certificate[4]['conflicts'][1:] + require(conflict_bound(groups, missing)[0] == 1, 'missing conflict control') + values = list(map(Fraction, certificate[4]['witness'])) + values[-1] = Fraction(1) + wrong = schedule_from_prefixes(variables, values, active, deadlines, 4) + output = s.run_column(4, wrong, arrivals, deadlines, weights) + require(s.junk(4, output, labels) == 44, 'lost gain control') + late = deepcopy(wrong) + late[6] = [(2, 1)] + reject(lambda: s.run_column(4, late, arrivals, deadlines, weights), 'gather after cutoff') + bad_total = deepcopy(wrong) + bad_total[6] = [(0, 2)] + reject(lambda: s.run_column(4, bad_total, arrivals, deadlines, weights), + 'gather coefficients must sum to one') + mode = ['-O'] if sys.flags.optimize else [] + result = subprocess.run([sys.executable, '-W', 'error', *mode, '-B', + str(ROOT / 'retained/source7748/verify.py')], + capture_output=True, text=True, timeout=30) + require(result.returncode == 0 and 'PASS_P104_C56_SPLIT_GATHER_WITNESS' in result.stdout, + 'unchanged source replay') + print('PASS_P104_FIXED_FLAG_SPLIT_OPTIMUM') + print('104 columns: exact rational split optimum 4745; single-gather optimum 4814') + print('4715 forced cells and 23 contradiction certificates force 30 more; 1400 subsets agree') + print('490 gather pieces; 104 diagonals and 5720 odd zeros; source column 4 improves 44 to 43') + + +if __name__ == '__main__': + verify()