docs: Nutzen je Knoten festgelegt — (M/9) im Größen-Token, lohnendster Pfad (SPEC §11)

Geplant, nicht gebaut: Ziffer 0-9 im Größen-Token (0 = Vorbedingung),
reine Autoren-Aussage ohne Aggregation; der Pfad-Knopf wird ein
Durchschalter aus -> günstigster -> lohnendster. Plan-Knoten
#not.benefit (XOR-Gruppe aufgelöst) und #ed.path.worth.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>

docs/examples/werkbaum.werkbaum

@@ -28,9 +28,9 @@
     - [ ] #not.ticket: Ticket references (#123,#US-123) (S)  %% Taiga writes #US-123 for a user story
     - [^] #not.llms: llms.md, the notation explained to AI agents (S)
       - [^] #not.llms.index: llms.txt, the signpost that points at it (XS)  %% the convention wants an index, not the content
-    - [?] #not.benefit: Benefit per node, not only cost (M)
-      | [?] #not.benefit.sigil: Another sigil next to the size (S)
-      | [?] #not.benefit.points: Story points behind the T-shirt sizes (M)
+    - [ ] #not.benefit: Benefit per node: a 0-9 digit in the size token (M)  %% (M/9), benefit alone as (/7) — see SPEC §11
+      - [-] #not.benefit.sigil: A separate sigil next to the size (S)  %% one token in one corner won
+      - [-] #not.benefit.points: Story points behind the T-shirt sizes (M)  %% false precision — the sizes stay ordinal
   - [~] #ed: Editor (XXL) https://werkbaum.javagil.de
     - [^] #ed.live: Live diagram from text (L)
       - [^] #ed.parser: Parser (S)
@@ -52,6 +52,7 @@
       - [^] #ed.path.line: Metro-map line through the leaves (S)
       - [^] #ed.path.step: Step from station to station, one button (S)  %% see D47
       - [^] #ed.path.load: Warn when one person is the bottleneck (S)  %% see D71
+      - [ ] #ed.path.worth: The most worthwhile path: one button, three states (M) :#not.benefit
       - [^] #ed.closure: Count the whole dependency closure (M)
         - [^] #ed.closure.once: Shared dependencies counted only once (S)
         - [^] #ed.closure.nonlocal: The cheapest alternative is no longer the local one (M)  %% see D34, D42
@@ -341,18 +342,22 @@
   the one address an agent tries on its own.
 
 #not.benefit
-  Sizes say what something costs; nothing yet says what it is worth. With both
-  you could sort by value for money instead of only minimizing cost.
+  A benefit rating independent of the effort estimate, weighed against it
+  only at prioritization time. Written inside the size token — (M/9), or
+  (/7) without a size — one digit 0-9, where 0 marks a precondition that
+  must be done but has no benefit of its own. A pure author statement: no
+  aggregation, no conflict check, no estimation — benefit, unlike cost, is
+  not additive. Spelled out in SPEC §11.
 
 #not.benefit.sigil
-  A separate character next to the size, in the spirit of everything else in
-  the line. Needs a collision-free sigil, and parentheses, @, # and %% are
-  taken.
+  A separate character next to the size was the first idea; it lost to one
+  token in one corner — (M/9) needs no new sigil, no new badge and leaves
+  the node corners as they are.
 
 #not.benefit.points
   Put numbers behind the T-shirt sizes and both benefit and effort become
-  addable. That buys the effort rollup as well, at the price of a mapping
-  convention the ordinal sizes deliberately avoid today.
+  addable — at the price of a precision the ordinal sizes deliberately do
+  not claim. The 0-9 digit keeps the benefit ordinal instead.
 
 #ed
   The browser editor: text on one side, a live diagram on the other, no server
@@ -452,6 +457,14 @@
   would serialize through that person. Untagged nodes inherit the nearest
   tagged ancestor, and the person's tag pills turn amber on open path nodes.
 
+#ed.path.worth
+  The path toggle becomes a three-state button: off, cheapest, most
+  worthwhile. In the third state an alternative group picks the best
+  benefit/cost ratio; rated beats unrated, a group with no ratings at all
+  falls back to cost — without benefit ratings the most worthwhile path IS
+  the cheapest. Realized stays realized, discarded never counts; line,
+  stations and inversion keep their mechanics.
+
 #ed.closure
   The cheapest path pulls every dependency of a needed node into the needed
   set, and shared targets count only once. That is why an alternative can win