glove-parity: an edge table as the anchor, and distinct targets of a hop (D-CMH-G1-4b)

.claude/board/STATUS_BOARD.md

@@ -23,8 +23,10 @@ Plan: `.claude/plans/gremlin-composable-algebra-v1.md`.
 | D-CMH-G1-2 | typed Gremlin steps → method body | Shipped (#1508) | == direct Quack program; both frontends == row oracle |
 | D-CMH-G1-3 | Gremlin-shaped runtime declarations | Shipped (#1508) | loads after the build; effects refused at load |
 | D-CMH-G1-4a | functional relation carrier: `out(rel)`, `out(rel).has`, `count()` | Shipped (#1514; ConflictingUniverse fix follows) | row loop over the text at n ∈ {1,64,65,4097}; 6 disable runs red; R2IL refuses (no `GATHER`) |
-| D-CMH-G1-4 | rest of the relation carrier (fan-out moves the anchor; `E()`, `outE/inV`) | Queued | #1311 bulk oracle + DuckDB through the method layer | #1311 bulk oracle + DuckDB through the method layer |
+| D-CMH-G1-4b | edge table as the anchor (`E()`, M:N one hop, `outE/inV`) + `Fold::Distinct` (`out(rel).dedup().count()`) | In PR | bag and set == row loop over the text at n ∈ {1,64,65,4097}; unordered key lane refused (`LaneNotOrdered`); 7 disable runs red |
+| D-CMH-G1-4 | rest: a second hop (blocked on the chained-hop decision), `V(parent).in(rel)` spelling, `bothE` | Queued | — |
 | D-CMH-G1-5 | FirstOfRun | Queued | insufficiency proof first; Quack + R2IL vs independent oracle |
+| D-CMH-G1-6 | ordered `I32` conditions + `MIN`/`MAX` folds as method steps; R2IL `MIN`/`MAX` wired | In PR | both frontends == row loop incl. empty selection; 8 disable runs red |
 
 ## D-NALP — `NAL::narsese()` polyfill over R2IL procedures and mask-risc (2026-10-12)
 

.claude/board/entries/2026-10-12-edge-table-anchor-distinct.md

@@ -0,0 +1,19 @@
+# 2026-10-12 — D-CMH-G1-4b: an edge table as the anchor, and distinct targets
+
+**Status:** In PR. **Plan:** `.claude/plans/gremlin-composable-algebra-v1.md` §10.
+
+An M:N relation is its own concept with a functional relation to each end, so
+each edge row is one traverser: `out(end).count()` is the bag and the new
+`Fold::Distinct` (`out(end).dedup().count()`) the set. Both ends are filtered at
+the source through the key; no program produces a mask another reads.
+`Fold::Distinct` lowers to the liveness semijoin plus
+`CountDistinctOrderedU32` (two words of state) and needs the key lane in key
+order; an unordered lane is refused (`LaneNotOrdered`), never miscounted.
+
+MEASURED (tests/distinct.rs, row loop over field text, n ∈ {1,64,65,4097}):
+bag and set equal the oracle and differ on this data; seven disable runs red on
+the test that names each guard.
+
+OPEN: a second hop stays refused. It needs the chained-hop decision
+(`2026-10-03-coresearch-chained-hop.md`): every multi-hop question in
+#1510/#1512/#1515 waits on it.

.claude/board/entries/2026-10-12-ordered-conditions-and-extrema.md

@@ -0,0 +1,20 @@
+# 2026-10-12 — D-CMH-G1-6: ordered I32 conditions and MIN/MAX as method steps
+
+**Status:** In PR. **Plan:** `.claude/plans/gremlin-composable-algebra-v1.md` §9.
+
+`Cond::Order` (<, <=, >, >= on an I32 field, in lane units) and
+`Fold::Min/Max` reach both frontends. R2IL's `MIN`/`MAX` fold calls, defined
+in OGAR but refused as unimplemented here, are now wired onto mask-risc's
+MaskedMinI32/MaxI32. No new opcode anywhere.
+
+MEASURED: `tests/ordered.rs`, both frontends equal a row loop over the
+indicator text at n ∈ {1,64,65,4097}, for every comparison at five
+thresholds including an empty selection. Eight disable runs red.
+
+DECISION: an empty `MIN`/`MAX` is `None` on both frontends. R2IL's stack has no
+null, so it pushes the fold's identity (i64::MAX / i64::MIN), the same seed
+mask-risc's grouped MIN/MAX leave in an empty group; the method layer reads
+it as `None`. REVISIT WHEN: R2IL gains a null value.
+
+OPEN: an ordered literal is in the lane's units, not the canonical unit a
+converted claim names; a unit-aware literal needs the claim's conversion.

.claude/board/entries/README.md

@@ -25,15 +25,17 @@ index row, (3) no duplicate entry id. Checks 1 and 2 are deliberately
 opposite directions; the stranding this convention prevents shows up in
 exactly one of them, never both.
 
-317 entries, 2026-08-06 .. 2026-10-12.
+319 entries, 2026-08-06 .. 2026-10-12.
 
 | date | entry id | finding | file |
 |---|---|---|---|
 | 2026-10-12 | `D-SAG-1` |  | [2026-10-12-software-awareness-graph.md](2026-10-12-software-awareness-graph.md) |
+| 2026-10-12 | `D-CMH-G1-6` |  | [2026-10-12-ordered-conditions-and-extrema.md](2026-10-12-ordered-conditions-and-extrema.md) |
 | 2026-10-12 | `opencog-pln-entropy-research-map` | Source inventory and falsifiable PLN/ECAN/Shannon/Moore attention comparison: entropy target, evidence overlap, graph projection, resource fairness | [2026-10-12-opencog-pln-entropy-research-map.md](2026-10-12-opencog-pln-entropy-research-map.md) |
 | 2026-10-12 | `nars-self-evidence-literature` | NARS internal trace versus evidence, Jøsang dependent/independent fusion and fission, and the snapshot-stable fold assumption; source-grounded red tests for merged #1496 | [2026-10-12-nars-self-evidence-literature.md](2026-10-12-nars-self-evidence-literature.md) |
 | 2026-10-12 | `hyperon-metta-lg-translation` | Hyperon/MeTTa to LG sibling map: atom/hypergraph roundtrip, binding and rewrite parity, typed folds, scoped effects and 15 open questions | [2026-10-12-hyperon-metta-lg-translation.md](2026-10-12-hyperon-metta-lg-translation.md) |
 | 2026-10-12 | `D-CMH-G1-4a` |  | [2026-10-12-functional-relation-carrier.md](2026-10-12-functional-relation-carrier.md) |
+| 2026-10-12 | `D-CMH-G1-4b` |  | [2026-10-12-edge-table-anchor-distinct.md](2026-10-12-edge-table-anchor-distinct.md) |
 | 2026-10-12 | `D-CMH-0` | Class × Schema × Methods activation connects HotPlug, WideFieldMask, Quack and R2IL without a second registry | [2026-10-12-d-cmh-0-class-method-hotplug-activation.md](2026-10-12-d-cmh-0-class-method-hotplug-activation.md) |
 | 2026-10-12 | `D-CMH-1` |  | [2026-10-12-class-method-polyfill-ledger.md](2026-10-12-class-method-polyfill-ledger.md) |
 | 2026-10-12 | `D-HL-0` | CE64 hypothesis layers: plateau of the design (opaque LE bytes, 64 sparse-delta layers merged on read, Narsese-parallel validation), 8 design-vs-code conflicts, 9 unification hypotheses | [2026-10-12-ce64-hypothesis-layers-plateau.md](2026-10-12-ce64-hypothesis-layers-plateau.md) |