- commit
- fcc26c0f023261443351e6774b9a00fbef34535f
- parent
- 88dbdce4051a3fb034d00df61ac77197b1e179fa
- author
- Dami <dami.etoile@gmail.com>
| A | openspec/ | 14 | ++++++++++++++ |
@@ -0,0 +1,14 @@
1+# Solver baseline before W32+3+Measured on the local development host with Node 26.8.1 after W6 and the restore-idempotence fix. `process.memoryUsage().rss` was sampled every 20 ms from a temporary preload; elapsed time includes load, search, and BYPASS re-search when applicable. These are comparison data, not portable timing gates. The current CLI does not print explored transitions for solved proofs, so expansion counts remain to be instrumented in task 1.1.4+5+| Pack / proof | Cap | Result | Elapsed | Peak RSS |6+| --- | ---: | --- | ---: | ---: |7+| Core / all 3 | 300,000 | 3 solved; 13, 9, 6 steps | 4.39 s | 246.7 MiB |8+| Word Lab / all 3 | 300,000 | 3 solved; 3, 6, 7 steps | 0.08 s | 65.1 MiB |9+| Crate Works / `night-shift` | 2,000,000 | solved, 48 steps | 1.00 s | 138.6 MiB |10+| Crossword / `pass-it-on` | 300,000 | solved, 25 steps | 28.43 s | 321.7 MiB |11+| Tidewater / `low-tide` | 2,000,000 | solved, 10 steps | 0.17 s | 75.2 MiB |12+| Clockwork / `mouse-hole` | 4,000,000 | solved, 23 steps | 9.39 s | 220.6 MiB |13+14+The W6 content review remains separate: `shove-the-danger` and `carry-the-pair` both reached LIMIT at 300,000 transitions before the worlds team's re-authoring. A LIMIT is inconclusive about solvability. The heavier Tidewater and Clockwork challenge cases have documented multi-million-state search needs and should be measured under a bounded memory budget after the compact codec is available.