Evidence row 580705

What was observed

{
  "count": 7,
  "tools": [
    {
      "description": "How do parts combine, or how does a part stand alone? Merge mode (source_a + source_b + links): declare which entities in A are the same as entities in B; the combined graph is wired via string-equality of shared names. Extract mode (source + subsystem): pull a named subsystem out as standalone EN with boundary inputs/outputs, actors, and locations. Valid subsystem names come from structure's `subsystems` field — call structure on the source first to discover them. See the server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "links": {
            "description": "Entity identifications, one per line. Format: `a.<entity name>=b.<entity name>` (A's entity is the same as B's entity). `#` starts a comment. Example: `a.user session=b.authenticated session`.",
            "type": "string"
          },
          "source": {
            "description": "EN source code for extract mode",
            "type": "string"
          },
          "source_a": {
            "description": "EN source code or path to .en/.txt file for the first system",
            "type": "string"
          },
          "source_b": {
            "description": "EN source code or path to .en/.txt file for the second system",
            "type": "string"
          },
          "subsystem": {
            "description": "Subsystem name to extract. Valid names come from structure's `subsystems` field — call structure on the source first to discover them.",
            "type": "string"
          }
        },
        "required": [],
        "type": "object"
      },
      "name": "compose"
    },
    {
      "description": "Are two systems the same, or what changes if I change this one? Compare mode (source_a + source_b): structural differences, edit distance, spectral equivalence. isCospectral=true means identical graph structure up to relabeling — topologically the same despite different names, actors, or locations. Evolve mode (source + patch): dry-run a change, shows diff plus new/lost bridge nodes. Patch has three directive types — plain EN statement adds an action; a line starting with `-` (and not containing `do:`) removes the named action; a statement whose action name matches an existing one replaces the original. See the server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "patch": {
            "description": "EN patch for evolve mode. Three directive types: plain EN statement (`actor do: X needs: Y yields: Z at: W`) adds action X; a line starting with `-` (and not containing `do:`) removes the named action; a new statement with an existing action name replaces the original. Multiple directives allowed, one per line.",
            "type": "string"
          },
          "source": {
            "description": "EN source code for evolve mode",
            "type": "string"
          },
          "source_a": {
            "description": "EN source code or path to .en/.txt file for the first system",
            "type": "string"
          },
          "source_b": {
            "description": "EN source code or path to .en/.txt file for the second system",
            "type": "string"
          }
        },
        "required": [],
        "type": "object"
      },
      "name": "equivalent"
    },
    {
      "description": "What's always true — automatic findings and on-demand checks. Automatic outputs: conservationLaws (weighted entity sums constant across executions), sustainableCycles (T-invariants — action sequences returning to start state), depletableSets (entity groups whose simultaneous depletion is irreversible), behavioral.deficiency (0 means structure fully determines dynamics), behavioral.isReversible, behavioral.hasUniqueEquilibrium. On-demand via `rules`: encode domain-specific claims and verify them against the graph — this is how to check things the topology alone can't see (precedence, coverage, centrality bounds, resilience). See the rules parameter for supported sentence shapes.",
      "inputSchema": {
        "properties": {
          "rules": {
            "description": "Custom structural rules, one per line. Four supported sentence shapes (regex-matched): (1) `no bridge that is also hub` — flags nodes that are both a bridge and a hub. (2) `every path from X to Y passes through at least one of [A, B, C]` — encodes precedence/coverage; use to check `A must happen before Y produces Z` by rewriting as `every path from Z's input to Z passes through [A]`. (3) `no node with centrality above 0.5` — flags over-central nodes (replace 0.5 with any threshold). (4) `removing any single node disconnects at most N others` — connectivity robustness check. Unrecognized rules return satisfied:false with an explanation listing these shapes.",
            "type": "string"
          },
          "source": {
            "description": "EN source code, or path to .en/.txt file",
            "type": "string"
          }
        },
        "required": [
          "source"
        ],
        "type": "object"
      },
      "name": "invariant"
    },
    {
      "description": "Can it deadlock? Can entities overflow? isStructurallyLive means every siphon contains a trap — no structural deadlock possible. uncoveredSiphons are entity groups that can drain permanently, with the actors and locations affected. isStructurallyBounded means no entity can accumulate without limit. unboundedCycles are action sequences that could cause overflow. See the server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "source": {
            "description": "EN source code, or path to .en/.txt file",
            "type": "string"
          }
        },
        "required": [
          "source"
        ],
        "type": "object"
      },
      "name": "live"
    },
    {
      "description": "Can X reach Y? Follows directed data flow first; falls back to undirected. `from` and `to` accept entity names or action names (resolved against the program). Path shows each step with actor and location. locationCrossings counts boundary transitions. defense_nodes checks if guards cover all paths; coverage.fullCoverage=false means unguarded routes exist. See the server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "defense_nodes": {
            "description": "Comma-separated guard nodes to check coverage",
            "type": "string"
          },
          "from": {
            "description": "Starting node name",
            "type": "string"
          },
          "source": {
            "description": "EN source code",
            "type": "string"
          },
          "to": {
            "description": "Target node name",
            "type": "string"
          }
        },
        "required": [
          "source",
          "from",
          "to"
        ],
        "type": "object"
      },
      "name": "reachable"
    },
    {
      "description": "SVG or PNG diagram. Only call when user explicitly asks to visualize. The rendered image is delivered to the user, not injected into the model's context. See the server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "color": {
            "description": "Seed color hex (#RRGGBB) to generate a custom theme. Overrides theme parameter. One color generates the entire palette.",
            "type": "string"
          },
          "direction": {
            "description": "Layout direction: LR (left-to-right) or TB (top-to-bottom). Default auto-detects from condensation DAG aspect ratio.",
            "type": "string"
          },
          "isDark": {
            "description": "true or false. Selects the dark or light variant of a named preset. If omitted, defaults to dark unless theme=light.",
            "type": "string"
          },
          "output": {
            "description": "File path to save the rendered image",
            "type": "string"
          },
          "quality": {
            "description": "Output quality: small, mid, or max",
            "type": "string"
          },
          "source": {
            "description": "EN source code, or path to .en/.txt file",
            "type": "string"
          },
          "structure_layers": {
            "description": "Bitmask for structure overlays. Bits: 1=subsystems, 2=pipelines, 4=cycles, 8=forks, 16=joins, 32=hubs, 64=deadlock, 128=overflow. Default 255 (all on). Pass 0 to hide all.",
            "type": "string"
          },
          "theme": {
            "description": "Color theme. Curated presets (each with light + dark variants; pair with `isDark`): `Editorial` (stone paper + rust focal, adapted from cathrynlavery/diagram-design), `Primer` (GitHub design system — blue accent, data-vis roles), `Carbon` (IBM Carbon — sharp 0px corners, corporate blue). Or seed-derived palettes generated on the fly from `color`. Pass 'dark'/'light' for the default variant. Overridden by `color` if provided.",
            "type": "string"
          },
          "type": {
            "description": "Output format: png (default) or svg. PNG is rasterized server-side via Batik.",
            "type": "string"
          },
          "view": {
            "description": "Group by: actors (partition by actor) or locations (partition by location). Default auto-detects topology.",
            "type": "string"
          }
        },
        "required": [
          "source"
        ],
        "type": "object"
      },
      "name": "render"
    },
    {
      "description": "What is this system? Returns shape (Pipeline, Fork-Join, DAG, Star, Cycle, Tree, Complete, etc.), stages with roles, bridge nodes, cycles, parallelism, critical path, dominator tree, min-cuts, subsystems, interface nodes, actors (who does what, workload entropy), locations (where work happens, boundary crossings). Levers: node=X returns per-node centrality (betweenness, closeness, eigenvector) for a specific node. detect_findings=true flags named structural risks — unguarded-sink (sinks reachable via only pipeline actions, no JOIN/HUB gating), single-cut-path (source-sink pairs with only one vertex-disjoint path), multi-cut-path (paths with redundant defense, min-cut > 1). See server instructions for EN language syntax.",
      "inputSchema": {
        "properties": {
          "detect_findings": {
            "description": "Set to 'true' to flag named structural findings. Possible values: unguarded-sink, single-cut-path, multi-cut-path.",
            "type": "string"
          },
          "node": {
            "description": "Node name. When provided, returns per-node centrality (betweenness, closeness, eigenvector) for this specific node instead of the overview.",
            "type": "string"
          },
          "source": {
            "description": "EN source code, or path to .en/.txt file",
            "type": "string"
          }
        },
        "required": [
          "source"
        ],
        "type": "object"
      },
      "name": "structure"
    }
  ]
}

What the leaf hashes

{"body":"839e68efd3b262f54c5f83612892befcbf6fba9623ab4537bee87d71350f4024","id":580705,"kind":"mcp.tools","method":"probe.mcp/1","observed_us":1793143941898912,"prev":null,"subject":"dd8819ba-2510-4380-b48a-c2abd5aa1602","subject_kind":"endpoint"}

Proof

Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of 2026-10-27 (273461 rows).

1. 0x20775ab3ff133095323c1a475f55b01822af40c69ddd484ef73d11e999f53b63
2. 0x131181703c8d6cbba5c9324a2962c06ad88c5a3d6ca87edb103676bb03f345dc
3. 0x202dad5a8a1a1c86322489c10fac7ab18b0aefadf8c0831d231c3ac16a7fc55c
4. 0x7e0244d47192e6ad4cfcde952ffaed652f7823e92960c923368ce4526c19677b
5. 0xf3d73376a8e00e7a6dae6bf44bd64b8359c9924d9fd073ed460ae80e089e608a
6. 0x6d4909c25a9e8e3adcd822dffa6da08fca8dec147c30a3489c13c68039b01f24
7. 0x6ca09170c84aaf8607e8af0ad90d4ee35e1d42bd82e6f5aed7cf341501bf9a6a
8. 0x7abed5702409e303554fe9d229e66dd517ba39972a01c4a1e4943dc1d0341598
9. 0xd8296b6b395c14cd51624f5a3cdc48d63ba64d10cdf08d55269372c893b9ab9f
10. 0xb199ba890edf687ced6e709304afc3d2a644959e04bfcc4e4cf7c255e48af8a8
11. 0x5b0b64ab1e36bf2ec3c04be82716d130476b3af9a60be0d19dcbdf8a3b7e3da9
12. 0xd4460ea292e8308ed2accdcd5b386b0914636a5b8cec975011dff814c29ff99a
13. 0x20ca24353b8aca3e061eedf55f49b69ae8369b88135dfdabf30039ed34db329a
14. 0xe8ee6f6ed50253c5ee2d1aa85a4b1a38ce94bca7f3b72fd1850f496152dbe285
15. 0xa383a1cfe9b3f6af67eb4c7642564b9424d46d7fca90e7ba175d549f8b67dd0c
16. 0x52efa60e0c3d8525486d2310eb3b6b566c9677c64fd1f819edb072cf101bcbdb
17. 0x22c1fb9487ee0b9732fa017a0cc321eb27a60c08450d112f755089796e12cb1c
18. 0xa20d48798a34aba12eb9c7297722982d910f06c148f5e27ac59307422964a585
19. 0x9fc354c0ea3efc3f1b6548bb77ea902a50f2c9647647ea61592efce2bd795699

Day root

0xdd77e5e99da32c3f154180d63e3c3e6fe11e896a2c6896412ef6b5c4bcf7e795

Chained

0x23bb4dfd09f55c15ac3962f53578e02c6114d5bfd9bb451cf8794fb6e2817ef4

Published

On Arc Testnet, block 69414147: 0xb2ebd83aafeb765a0ce66e76aefb133ed06606c98038fd56191e2bcd1dcb77b4