Skip to content

Compose bounded repairs for indexed record copies - #7

Merged
RetroGameDeveloper merged 1 commit into
mainfrom
feat/record-repair-replay
Nov 16, 2026
Merged

RetroGameDeveloper merged 1 commit into
mainfrom
feat/record-repair-replay

Conversation

@RetroGameDeveloper

Copy link
Copy Markdown
Contributor

Repeated indexed-record copies could miss existing repairs because they use nested global records, conversion macros and candidate-owned volatile words. Add a finite composition of declared-stride rebasing, retained word reads, conversion placement, ordinary field-store ordering, byte captures and index carriers. The library only proposes complete C candidates; it never compiles or supplies a match verdict.

Raw MIPS bases, declared scalar widths, disjoint fields, pure indices and private declaration spans gate proposals. Existing volatile access order is retained; unknown layouts, observable line macros, effectful accesses and unsupported macros decline. The recipe is capped at 64 alternatives and does not exclude a large function solely for exceeding 512 instructions. Bump the library to 0.5.2 for the app integration.

Validation: ruff passes; 120 tests passed, 1 skipped. A copied ROM-backed development replay starts only with the frozen original source/header/target/compiler: the integrated app selector improves score 9772 to 150 on trial 18 within 64 trials; the previous selector stays at 9772 under the same budget. This recovers a prior 99.8% near match, not an exact match or new game progress. No manual intermediate is supplied to the search. Public tests use homemade records and words only; private game data/source and the running app are untouched.

@RetroGameDeveloper
RetroGameDeveloper merged commit ee1a829 into main Nov 16, 2026
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant