A line like `x = <formula> mod N` can't be solved for x (it's just a name for "whatever this reduces to"), so the chain handler gave up on any modular equation once a bare symbol was involved. That silently passed over real errors in exactly the shape a CRT reconstruction produces: `x = 2*77*2+... mod 231` followed by a contradicting `x ≡ 57+66+126 mod 231` (the latter reduces to a different value mod 231) went unflagged. Now, when exactly one side of the chain is a bare single letter and every other side is a plain number, its reduced value is tracked in known_vars the same way solved variables already are - catching the mismatch as a contradiction without ever needing to solve for x. Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> |
||
|---|---|---|
| .. | ||
| hooks.json | ||
| verify-calculations.sh | ||