Repository navigation
Conversation
This was referenced Nov 3, 2026
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.
Summary
Prove that PR5456's linear-support BIT obstruction survives arbitrary finite field ownership. This is a scoped written algebraic proof with exact finite corroboration, produced by Nick Petalas. No new kappa is claimed.
The terminal-block criterion is also sufficient in the unrestricted linear endpoint relaxation, with native-chain requirements explicitly excluded from that converse. A full three-call, three-owner boundary control has all native chains and closes outside the linear-intersection hypothesis.
Credit Ali Romman / PR5456 at
0d64d4d5d73f370182ada9825a611c86cfbf0049for the model, coefficient equation, two-owner theorem and open ownership question; Dillon Amburgey / dillona's PR5388 early-helper interface and the retained BIT/native/owner/compiler lineage; Brian / PR5507 for the complementary two-owner multigraph funding theorem. These are cited inputs, not audit or replay deliverables. The new proof and checker import no predecessor executable. Advance CLAIM.Evidence
Before: PR5456 excludes fields with more than two owners from its last-call theorem. After: the written proof removes that cap, and gives the exact terminal response blocks for arbitrary coordinate-support histories.
Local checks pass on Darwin 27.0.0 arm64, CPython 3.12.15, standard library only:
Each registered command was timed directly at 0.27 and 0.28 seconds; the complete registered launcher took 0.77 seconds. These are check durations, not a performance-improvement claim. The focused staged diff passed whitespace checks. Static parsing/compilation passed; the largest function has 31 lines.
From the repository root:
Substitute another CPython 3.12 executable when needed. Expected markers are
PASS_BIT_LINEAR_SUPPORT_OWNERSHIP,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. Receipts are generated from actual enumeration and bind all package files by SHA256. No receipt is handwritten.Limitations and unrun obligations
Formal coefficientwise equality over F2 with independent commuting stage involutions and q squared zero is essential. Supports are coordinate supports, every response column belongs to its call, and outside-support response rows are permitted. The obstruction does not cover arbitrary many-owner intersections, dependent stage symbols, non-coordinate stage projectors, extra thin calls or free interleaved address maps. Relaxation attainment supplies no earlier native chains or funded caller.
The universal statement relies on the written proof; bounded checks corroborate it. No physical implementation, paid/productive invoice, uniform compiler, precision/tape, stock, analytic recovery, all-size multiplication theorem or selected cold replay is supplied. The selected frontier is unchanged and all five framework assumptions remain. Independent human and formal proof-kernel review are unclaimed. Every registered command ran locally; no proof check is deferred to CI.
Base: canonical main
7c49fe32c55de02c2c873655c804b16e4c3fef0a, refreshed unchanged before submission, priority revision 8 and selected PR6030. The bit-helper-contract card explicitly changes to this algebraic interface obstruction. The selected binding-only positive control passed. Live PRs, current claims, local reservations, distinctive main and merged-object/general-form searches, and the complete cached overlap inventory were checked. Arbitrary code diffs and unpublished work remain coverage limits.Open next questions
Can a source-compatible many-owner caller with a repeated terminal pair improve the complete signed bill? First give a completed native word whose final chain lies in a nontrivial latest-owner block, then charge all distinct productive helpers, paid calls, restoration and consumer costs. Passing this necessary test alone is insufficient; no funded candidate is supplied.
Related open work
The live exact-source and object searches found no open PR studying this many-owner independent-stage coordinate-support endpoint. PR5456 and PR5507 are merged predecessors. PR5527 has one shared D and a different rank/invoice model. PR5928's local two-matrix spectral envelopes concern a different predicate, without chronological support histories. Those results are cited context, with no additional computations to compare them. Completion refresh checked all 12 account open PRs created since the CLAIM at 2026-11-03T11:07:16Z, including this PR. No other entry studies this many-owner independent-stage support endpoint. Nearby work has different hypotheses and quantities, with no numerical comparison asserted:
CI notes
Both hosted checks passed at head
416978925318bf73554ff5ec1014df8b71b3d504in Registered research packages run 41625860675:planin 4m12s andreplay (research/bit-linear-support-ownership)in 1m21s. The completed checks were read once withgh pr checks. Hosted replay runs both registered normal and optimized commands. All local checks listed above also passed; no registered check was deferred to CI. Passing replay confirms these registered checks, without claiming independent human or formal proof-kernel acceptance.Merge danger
Door: two-way. Blast radius: isolated. Six new files in one research package; no shared code, frozen evidence, predecessor credit or selected-frontier records change.