Repository navigation
Prove excluded clique X0 has Boolean host charge exactly 7 (no κ) - #275
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
Exhaustive census of every charged support of size at most 6 on the 120 root lines. The flat indicator (1+x0)(1+x5)(1+x3+x6) attains charge 7. No kappa change. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Change and mathematical scope
Exhaustive finite census, not a heuristic and not a κ change. On the 120 root lines, every Boolean host of excluded clique X0 has algebraic-normal-form charge at least 7, and the 5-flat indicator
(1+x0)(1+x5)(1+x3+x6)attains 7. The selected frontier stays κ = 363005817/100000000000. This is a host-charge statement, not an invoice.A host equals the X0 indicator on
{Q = 1}in the simple-root chart. Values off the 120 lines are free. The charge counts monomials of degree at least 2; affine monomials are not counted. X0 is the excluded odd 8-clique with ports(7, 25, 42, 52, 76, 82, 97, 127), not one of the 13 P104 frames. The other fourteen cliques are untouched.The charged coset, after eliminating the 9 affine monomials, is a 111-by-247 system
H d = s. The census enumerates all 304,181,752,291 supports of size at most 6 by a three-block case split (weightsx ≥ y ≥ z):x ≤ 2: every triple of supports of weight at most 2x = 3andy ≤ 2: the weight-3 block plus light pairs of total weight at most 3x = y = 3: the two weight-3 blocksx ≥ 4: that exact heavy weight, split across one halving, against light weight at most6 - xBoth the monomial order and the stride order
(index mod 5, index)return no solution. The flat host is checked by expansion, by the subset-sum transform, and by evaluation on every root line. Its twelve monomials are the charge-7 host recorded for row 13 of CrocSwap#7167.Task and overlap
Base:
e54523517d0f03e58352e647c403a5af3e525a57. Package:research/p104-x0-boolean-host-floor. Cardcomplex-rank-shape-decoder, scope changed: this does not change a decoder or a signed moment. It answers the X0 half of open question 1 of CrocSwap#7167. The degree-at-most-4 branch-and-bound was not required, because the census includes every degree.Overlap at the 2026-11-11 cached snapshot (500 open PRs, 7172 discussion records, complete pagination) found this question only as the open question in CrocSwap#7167 and its CrocSwap#1166 finding. No settled X0 host-charge lower bound was in that snapshot. Search coverage is not proof against a later parallel claim.
This fork draft is based on
cursor/upstream-e545235-pin-6dfb, which is that upstream commit, because the fork'smainis not CrocSwapmain. The intended upstream base is CrocSwapmainate54523517d0f03e58352e647c403a5af3e525a57.Validation
Python 3.12, standard library only.
Local results:
PASS_X0_BOOLEAN_HOST_FLOOR,PASS_REGISTERED_RESEARCH_PACKAGE, andPASS_RESEARCH_COMMIT_BYTES. The same verifier passed underpython3 -I -O -B. One registered run took about one minute. Controls: all 31,180 basis targets of length 18 and weight at most 6; a corrupted host; an explicit one-column target; the XOR of the first six columns; an independent 120-by-9 affine solver on the charge-7 host and on two rejected weight-6 supports.Not run: Lean, Docker, a selected cold replay, the degree-at-most-4
2^52enumeration, any other row, and a replay of the CrocSwap#7167 executable.Credit
Prepared by unpaidmoon with substantial Cursor Grok assistance. Predecessors, cited and not replayed as executables: Nick Petalas, CrocSwap#7167; unpaidmoon, CrocSwap#7014, CrocSwap#7031 and CrocSwap#7047; DreamingOfClouds, CrocSwap#6933. Frame bytes are the CrocSwap#7167 copy of the CrocSwap#7014 witness, sha256
c75915c18fc06ac19cc90fb9911209517c071862fdf401b998d5075efc0cda0d. New work is Apache-2.0.Open next questions
Questions 2 and 3 of CrocSwap#7167 (joint thirteen-row union, and naming chart monomials as invoice primitives) are not taken. The second is κ-adjacent.
Workflow feedback (optional)
The three-block case split made a weight-6 coset census feasible in the standard-library verifier; direct enumeration of
C(247,6)is not. A one-column flip of the real syndrome is not itself a weight-1 solution, so the failure control has to plant an explicit column XOR.