add honest limitation note (not exact on long chains; Neural GPU drift)
Browse files
README.md
CHANGED
|
@@ -33,3 +33,7 @@ covers tiers 1-7. See `manifest.json` for the full architecture and training sum
|
|
| 33 |
- `entry_class`: `model.BitSerialReducer`
|
| 34 |
- `output_base`: 2
|
| 35 |
- Files: `model.py`, `manifest.json`, `weights.pt`.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 33 |
- `entry_class`: `model.BitSerialReducer`
|
| 34 |
- `output_base`: 2
|
| 35 |
- Files: `model.py`, `manifest.json`, `weights.pt`.
|
| 36 |
+
|
| 37 |
+
## Limitation (honest)
|
| 38 |
+
|
| 39 |
+
This model passes the random-operand benchmark but is not exact. On structured inputs (powers of two and other long doubling chains) the per-step reduction drifts for some primes beyond about 500 steps, reproducing the Neural GPU limitation (Price, Zaremba, Sutskever 2016). The benchmark tiers reflect average-case accuracy on the official scorer's random-operand distribution, not worst-case exactness of the underlying modular-multiplication operator.
|