The Mycelium · thread-map, rebuilt Nov 21, 2026 · 11:55 PM CST

Every verdict, one graph.

All 1,152 verdicts from the Master feed, indexed in the Mycelium as verdict:<id> chunks, drawn as one dependency graph — 2,913 verdict-to-verdict edges. The honest headline: explicit dependencies are sparse. Only 67 edges are true references (one verdict naming another). The rest is time order and semantic nearness — labelled as such, never dressed up as dependency.

1,152
verdicts, all in one place
1,121
open (1,099 open · 13 liked · 7 today · 2 now)
2,913
verdict → verdict edges
67
true references — explicit dependencies
50
open prerequisites — verdicts others depend on
136
verdicts with no verdict edge at all

The three lanes

Every open verdict sits in exactly one lane of the SuperTask. The graph orders work inside each lane — and its first finding is liberating: all 248 Lane A verdicts are startable now. None of them depends on another verdict.

Lane A — Vesper can do it

248

Builds, fixes, verifications, filings. Verified one by one before anything is touched; Maxx still taps “close” in the app — the machine key can read and suggest, never close.

Lane B — reads & disposals

580
  • 360 unclear — no classifying signal; each gets read and moved to A, C, or moot-with-a-reason.
  • 220 dream verdicts — disposed by Maxx at 10/day. Batch 1 done Nov 21 (10 accepted, 210 to go).

Lane C — needs Maxx

293
  • 118 outward sends or posts
  • 78 that cost money
  • 64 blocked on another person
  • 33 decisions only he can make

Plus 29 already in the workshop and 2 done. 248 + 580 + 293 = 1,121 open; 1,121 + 29 + 2 = 1,152 total. The arithmetic closes.

The graph

Nodes are verdicts, coloured by lane class and sized by how connected they are. Clusters form around class because that is how the queue is organised — toggle edge types to see the three very different kinds of link. References only is the true dependency skeleton: 67 edges, 41 verdicts depending on another.

Drag to pan · scroll or pinch to zoom · tap a node for detail

Prerequisites — do these early

Open verdicts that other verdicts point at. Most depended-upon first.

    Lane A — head of the queue

    Queue order: now → today → liked → open. Every one is unblocked.

      Browse all 1,152

      The whole queue, searchable. Filter by lane class or status; tap a row to load it in the graph.

      How to read the edges

      References (67) — a real dependency. One verdict’s text explicitly names another verdict or the chunk tree it lives in. If A references B, B comes first. Only 41 verdicts depend on another this way, and 50 open verdicts are depended upon.

      Precedes (576) — time direction only. A was decided before B in the same thread of work. Useful for reconstructing order, not proof that B needs A.

      Similar to (2,270) — semantic nearness. Embedding-close verdicts (cosine threshold 0.75). Nearness suggests “look at these together” — it is not a proven dependency, and the graph never presents it as one.

      The full graph is bigger than this page. Behind these 1,152 verdict nodes sit 26,869 chunk nodes — 28,021 nodes and 79,370 edges in graph.db. This page draws the verdict-to-verdict subgraph (2,913 edges) exported Nov 21, 2026. Standing rule: no edge without observed evidence — the graph never invents a dependency.