Repository navigation
Research note: bounded 112-port transvection boundary census - #2078
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 2026
Merged
Conversation
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
2 participants
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.
Result
Adds a bounded negative result for the selected pair-0 stage-0 forward / stage-1 backward boundary. Across all 112 pinned port pairs, the verifier checks every directed coordinate transvection
T_ij = I + E_ijonF_2^9:RESULT.jsonrecords the exact per-port candidate sets.The profile-only cost screen grants the mechanism two deleted rank-one boundary transitions per port and charges one rank-one shear. The selected local rank-one count falls from 2,412 to 21,701/9 per call. Its exact
a-ceiling rises from1690054109089/10^15to338060003381/200000000000000(0.01455%), weakening this bound. No new construction, legal composition, supplier integration, orkappais claimed.Reproduction
Both the exact verifier and metadata/pin check passed locally on Python 3.14. The repository package runner requires Python 3.12, which is unavailable in this environment; no local registered replay or hosted-CI result is claimed. The PR workflow can run the declared Python 3.12 replay.
Scope and provenance
Seed
0410adea86dfbb7cdf86b46ba736e993,recursive-interfaces/persistent-boundary, priority revision 3, exact basee112d71c8d7bb32435debcc54df932593dd8223a. Full source pins, selected-record provenance, task card, result, and remaining obligations are inresearch/rank1-transvection-boundary-seed0410/.This expands on the literal shared-axis test in Discussion #1986. PR #1155, PR #1930, PR #2060, and Discussion #2007 were checked and have distinct scopes; overlap refresh covered 350 open PRs and 729 discussions/comments with complete pagination and no warnings at 2026-10-14 18:49 UTC.
Substantial OpenAI Codex assistance is disclosed in
TASK.json. Apache-2.0.