3 Commits

Include renames

Author	SHA1	Message	Date
araharah-executor	5b7a1300c2	feat(08-02): implement the pure landmark compute core — L-suite GREEN ... farthestPointAnchors + landmarkTables + landmarkCoverage over the ĉ metric: edge weights floor-quantized once (Math.floor(seconds/q)), exact integer Dijkstras (Int32 labels, binary heap, lazy deletion), 0xFFFF sentinel, 65000-quantum loud overflow. Traversal law mirrors astar.ts verbatim: bit0 edges never relaxed in EITHER direction. Test-vector corrections caught at GREEN (expectations were wrong, implementation was right): - L4: rows index by anchor POSITION (row-major [l*N+v]), not node id - L6: the c-metric farthest node from corner 0 is interior node 18 (297q: interior hops cost 2x perimeter), not corner 24 (264q) — verified against an independent brute-force Dijkstra	2026-10-25 18:40:17 +08:00
araharah-executor	1bf413b3ac	test(08-02): L5 overflow vector becomes a 3-node path ... A 2-node graph has no degree>=2 candidates, so farthestPointAnchors returns empty before any Dijkstra runs and never reaches the overflow throw. Node 1 on a 3-node path is a candidate, so the selection pass actually exercises the law.	2026-10-25 18:37:01 +08:00
araharah-executor	c3a31ae7ee	test(08-02): add failing landmark-core suite (L1-L6) — RED gate ... Hand-computed vectors for the pure landmark compute core: deterministic degree-filtered farthest-point anchors, exact integer quanta (floor(2.55/0.1)=25, two edges=50), 0xFFFF sentinel + self-cell laws, oneway asymmetry, the 65000-quantum overflow throw, and the 5x5-grid corner-to-corner 264-quanta vector with coverage 1.0.	2026-10-25 18:35:15 +08:00