Each map slice is a rewrite graph: nodes are canonical ZX graphs, edges are rewrite instances, edge color is Δd — the change in ZX distance caused by that single rewrite.
Depth-3 BFS over applicable rule instances on the raw check graphs of the anchor set — the first real map slices. Node identity = color-refinement canonical hash; deterministic across local machine and build server (content hashes identical).
| Code | Nodes | Edges | Canonical labels | Node cap |
|---|---|---|---|---|
| [[4,2,2]] | 296 | 878 | 169 / 296 | not hit |
| [[5,1,3]] | 1010 | 1948 | 1009 / 1010 | hit |
| [[7,1,3]] Steane | 1021 | 1884 | 43 / 1021 | hit |
| [[9,1,3]] Shor | 1013 | 1918 | 6 / 1013 | hit |
dataset: data/t04_2026-10-04.json · content-hashed · sampling metadata inside
① Where canonical labels are sparse (Steane 43/1021, Shor 6/1013), the hash falls back to
deterministic id-order serialization — isomorphic relabelings may be counted as distinct nodes,
so those node counts are upper bounds, not exact enumeration.
② Edges carry (rule, position, before/after hash); Δd coloring is deliberately absent —
it requires RPK25 gadget-orbit fault semantics pinned to RPK24 Def 3.1 postselection readings
(an M0 task), not a rendering shortcut.
③ sp dominates the space on bare check circuits (lc structurally absent, pivot 0 applicable),
so these slices are spider-fusion landscapes.
| Field | Meaning |
|---|---|
| nodes[] | Canonical ZX graphs, content-hashed at T0 |
| edges[] | (rule name, position, Δd, before-hash, after-hash) |
| sampling | strategy, depth cap, node cap, rule order, fixed seed |
| engine | engine version + literature (RPK24) version pinned |
| oracle | anchor-code + Prop 3.3 gate results, all green |