test(era-hop): convergence assertions pin the RDR-180 full-digest identity

The walk now fully converges (engine 0.1.11->0.1.51, all five
collections service=12 seeded=12, ladder clean, idempotent second walk)
— the single remaining failure was the harness itself still asserting
the PRE-RDR-180 32-char identity: expected_reid derived sha256[:32] and
the conformance sweep required len==32, so it flagged the CORRECT 64-hex
ids as 'non-32-char id(s) present'. Expected ids now derive the full
digest; the sweep requires 64.

nexus-i5rbk / RDR-185 era-hop

Author: Hellblazer

tests/e2e/migration-rehearsal/rehearse_era_hop.sh

@@ -309,9 +309,10 @@ for name, want in seeded.items():
 # 2. Wire re-id: the legacy ids are GONE and the derived ones are PRESENT.
 #    `existing_ids(collection, ids)` returns the subset of *ids* present, so
 #    each direction is an exact membership probe. Exactness matters here more
-#    than usual: a 16-char legacy id is a strict PREFIX of its 32-char
-#    successor (both are sha256 of the same text), so any substring-flavoured
-#    check would report success against a store that never converged at all.
+#    than usual: a 16-char legacy id is a strict PREFIX of its 64-hex
+#    successor (both are sha256 of the same text — RDR-180: the FULL digest
+#    is the canonical identity), so any substring-flavoured check would
+#    report success against a store that never converged at all.
 for coll, old_ids in legacy.items():
     target = cross.get(coll, coll)
     want_new = expected.get(coll, [])
@@ -328,7 +329,7 @@ for coll, old_ids in legacy.items():
         print(f"       {target}: {len(missing_new)} derived id(s) absent: {missing_new[:3]}")
         fails += 1
     if not still_legacy and not missing_new:
-        print(f"       {target}: all {len(old_ids)} legacy ids -> their derived 32-char chashes")
+        print(f"       {target}: all {len(old_ids)} legacy ids -> their derived full-digest chashes")
 
 # 3. Nothing non-conformant anywhere in the migrated collections — the
 #    membership probes above are per-id, so this catches a stray id neither
@@ -337,14 +338,14 @@ for name in seeded:
     target = cross.get(name, name)
     try:
         bad_len = sorted(
-            cid for cid, _ in t3.list_chunks_with_metadata(target) if len(cid) != 32
+            cid for cid, _ in t3.list_chunks_with_metadata(target) if len(cid) != 64
         )
     except Exception as e:
         print(f"       {target}: list_chunks_with_metadata() error: {e}"); fails += 1; continue
     if bad_len:
-        print(f"       {target}: non-32-char id(s) present: {bad_len[:3]}"); fails += 1
+        print(f"       {target}: non-64-hex id(s) present: {bad_len[:3]}"); fails += 1
 if not fails:
-    print("       every migrated collection holds only conformant 32-char chunk ids")
+    print("       every migrated collection holds only conformant 64-hex chunk ids")
 
 sys.exit(1 if fails else 0)
 PY

tests/e2e/migration-rehearsal/seed_legacy.py

@@ -629,17 +629,18 @@ def main() -> int:
     if era_hop:
         # The driver asserts the CONVERGENCE, so it needs the before-state: the
         # exact legacy ids that must no longer exist anywhere post-walk, and the
-        # text they were derived from (the rung recomputes sha256(text)[:32] on
-        # the wire, so the expected new id is derivable here too — that is the
-        # whole point of wire re-id, and it makes the assertion exact rather
-        # than a "looks 32-char" shape check).
+        # text they were derived from (the rung recomputes the FULL
+        # sha256(text) hexdigest on the wire — the RDR-180 canonical identity;
+        # nexus-i5rbk widened the transform to the 32-hex era class too — so
+        # the expected new id is derivable here, and it makes the assertion
+        # exact rather than a "looks conformant" shape check).
         out["legacy_ids"] = {
             _ERA_LEGACY: chashes[_ERA_LEGACY],
             _ERA_NOTE: chashes[_ERA_NOTE],
         }
         out["expected_reid"] = {
-            _ERA_LEGACY: [_chash(f"era legacy chunk {i:04d}") for i in range(n)],
-            _ERA_NOTE: [_chash(f"era note chunk {i:04d}") for i in range(n)],
+            _ERA_LEGACY: [_sha_full(f"era legacy chunk {i:04d}") for i in range(n)],
+            _ERA_NOTE: [_sha_full(f"era note chunk {i:04d}") for i in range(n)],
         }
         out["sourceless"] = sorted(_SOURCELESS)
     if rdr180: