Compare compact solver payloads with full snapshots

Dami committed Sep 2483f1452

commit: 83f1452e3a234e993ffc105b1de373507084b689
parent: f9c0fb3fec919fd0cf42509a50020336fc39fa8b
author: Dami <dami.etoile@gmail.com>

1 file changed, +2 -0wrap lines

openspec/changes/scale-solver-state-search/baseline.md

M openspec/changes/scale-solver-state-search/baseline.md +2 -0

@@ -12,3 +12,5 @@ Measured on the local development host with Node 26.8.1 after W6 and the restore
1212 | Clockwork / `mouse-hole` | 4,000,000 | solved, 23 steps | 9.39 s | 220.6 MiB |1313 1414 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.15+16+The first codec slice encodes the three core starting states in 151, 265, and 69 bytes, versus 1,842, 3,131, and 1,153 characters for their full JSON snapshots. These are payload sizes before JavaScript object, queue, and map overhead; the BFS rewrite must measure actual peak RSS separately.