Repository navigation
Conversation
This was referenced Oct 30, 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
The unchanged rounded native cycle from JoyboyBrian's PR5492 has an explicit orbit with linear drift:
Claim type: scoped proof with an exact finite certificate. The new integral-shift argument proves the all-iteration identity from eight parity checks and a 24-traversal certificate. The ideal identity cycle therefore has infinite order after this rounding, with no path-length-independent absolute error envelope at any fixed dyadic grid.
An arbitrary deterministic correction decoder receiving only the unchanged rounded payload and a tag needs at least K+1 tag states for paths of lengths 0,24,...,24K on unrestricted signed integer inputs. The same final payload arises from K+1 distinct originals. The tag lower bound does not cover a fixed bounded input box or a decoder also given the path length.
Canonical CLAIM. The delivered scope matches the claimed orbit/drift alternative. Main and relevant guidance were refreshed at
2485805a6d47f36ea83ddde6327d453ac82d44dc, priority revision 8. The selected frontier is unchanged.Evidence
Before this contribution, PR5492 supplied one nonflat traversal. The new result supplies an exact drifting orbit, its universal shift certificate and a correction-state obstruction. No predecessor executable or scientific receipt was audited or replayed.
Local CPython 3.12.15 checks pass:
6112144851cc13fdd7183d4e909c6dcc841ea8e1.From the repository root, using the exact local interpreter:
Expected statuses are
PASS_NATIVE_LOOP_LINEAR_DRIFT,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. CPython 3.12 and the standard library suffice. Optional generated receipts bind all package file hashes; no receipt is handwritten or committed.Limitations
This is the fixed-grid width-one frame consistency diagnostic from PR5492, joining occurrences on different supplier fields. It is not a repeated chronological supplier subword. Other tensor widths, dynamic grids, changed edges, a physical implementation and a complete paid caller are unrun or unproved. All five selected framework assumptions remain. No new kappa, supplier admission, complete multiplication theorem, independent human review or formal proof-kernel acceptance is claimed. Every known finite reverse path remains exactly invertible.
Open next questions
Related open work
No open PR studying this fixed rounded cycle or its iterates was found in the refreshed coverage. The overlap cache covered 323 open PR bodies and 6,014 Discussion records with complete pagination; only 88 of 8,722 local note records were materialized, supplemented by main-tree formula/object searches. This is bounded coverage, not novelty certification.
PR6251 shortens the selected P104 scalar word. This result fixes the older signed cycle recipes and changes no scalar program.
PR6244 pays random-coin delivery at one reached halving site. Its stochastic half interface differs from the deterministic paired lifting studied here.
PR6249 reconstructs PR6167 numerical compiler conditions. No compiler threshold or invoice is recomputed here.
PR6257 proves a reader-497 merged-cache tariff on PR6167. It changes the cache contract and does not compute this rounded cycle's iterate formula.
PR6261 proves a correlated-dirt requirement at a P104 wire meeting. Its local response-space contract differs from repeated rounded frame transport.
The completion refresh checked this account's open PRs created since the CLAIM. No additional open PR studying this fixed rounded cycle or its drift quantity was identified. No new numerical comparison is made for the different contracts above.
CI notes
Both hosted checks,
planandreplay (research/native-loop-linear-drift), passed at exact head6112144851cc13fdd7183d4e909c6dcc841ea8e1in run 41049121971. The completed checks were read once; run metadata confirms completed/success and the matching head. Hosted replay certifies the registered finite checks. The universal claims rest on the written scoped proof; independent human and formal proof-kernel acceptance remain unclaimed. The registered normal and optimized commands and all listed transport checks also passed locally.Merge Danger
Door: two-way. Blast radius: isolated. Only the new research package is added; selected records, frozen sources and shared implementation remain unchanged.
This contribution is produced by Nick Petalas. Credit JoyboyBrian / PR5492 for the signed cycle and original defect; Tekalign's reversible lifting; Cao Yifan's word; ywz65's adapters; the coherent-frame-additivity and retained P104/native/controller/geometry lineage. Sricharan Vagvala / PR1631 and Sagar Thakrar / PR1537 supply related orbit-rounding and exact-return precedents under different contracts. Floor translation and the pigeonhole principle are classical. New work is Apache-2.0.