Repository navigation
Recover and compare bounded ARM64 state transitions - #5
Merged
Merged
Conversation
Codex Review SummaryThis comment shows the latest Codex review activity on this pull request.
ℹ️ About Codex in GitHubYour team has set up Codex to review pull requests in this repo. Reviews are triggered when you
Codex reacts with 👀 while any review is running, comments if it has suggestions, and reacts with 👍 once all reviews finish with no findings. |
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.
An edited function can return the right value while silently losing a state update. Rewynth now recovers and compares the return plus every word of an explicitly declared, bounded state buffer. The workbench and CLI support editable transition JSON, complete counterexamples, exact 64-bit tracing, workspace restoration and portable pure-transition C export.
The included lesson uses the unchanged PCG32 routine from pinned, attributed upstream source. A deleted-store control keeps its immediate return but fails the joint state comparison. Scope is one pointer to 1–3 fixed 64-bit words with at most four logical inputs; unsupported addressing and stateful inversion refuse explicitly.
Validation: a frozen local gate matched 37 states across 74 native calls; 28 new checks and 91 distinct data regressions passed; independent review exercised 16 product checks and 30 states across five generated C exports. Actual desktop/mobile workflows and an isolated installed-wheel lesson passed. Wheel and sdist contents match the frozen source. These checks establish the documented bounded model and finite examples, not general binary equivalence or an upstream PCG bug.