You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It looks like most of the code for this is already in solver.py. The trick is to provide a poor hint of a single bit, and to revise that bit if it's wrong.
So if my ROM solves like this:
air% solver.py --bytes 0x00:0x78,0x20:0x18 bits.txt --bin-out bits
Loaded 50x x 64 h => 3200 bits (400 words)
19 match True, score 1.000
r-270_flipx-0_invert-1_cols-left
Tries: 24
Best score: 1.000, r-270_flipx-0_invert-1_cols-left
Keep matches: 1
Writing bits
air% md5sum bits
feb69eb119ab8109b6f9865a11990b1c bits
air%
I can reproduce the decoding like this. If it were to fail, I'd just flip the lowest bit of the second --bytes parameter to get a working decoding. (Setting the mask byte to zero causes a division by zero error.)
Need some way to generically save solver results. ie you can get a single output right now, but you can't save that algorithm for a new chip
The text was updated successfully, but these errors were encountered: