mesh-issues and mesh-knowledge: milestones are records of the issue tracker, and progress reads them (ADR 0493 §1 to §4, issue 1781)

mesh-issues keeps each design's milestone in the state milestones (history 5), says milestone-set and milestone-moved, and serves milestones, milestone-set and milestone-move. An issue's milestone is its own link of kind milestone, so at most one milestone per issue is checked inside the issue's own write; kind commit links a fixing commit. The triage links no milestone, pull request or commit. import with milestones=N seeds a design's table once. mesh-knowledge's progress reads issue-tracker.milestones and its table parse is gone. Squashed from four commits so the branch history does not carry a compiled bundle that was committed by mistake (6 MB); the path is now in .gitignore.
2026-10-26 18:42:51 +01:00
parent 26908a8950
commit 76e4ec4dc6
24 changed files with 2912 additions and 196 deletions
@@ -14,6 +14,7 @@ modules/claude-code/claude-code
 modules/mesh-watcher/mesh-watcher
 modules/dnsmasq/dnsmasq
 modules/mesh-issues/cmd/mesh-issues/mesh-issues
+modules/mesh-issues/mesh-issues
 modules/mounts/cmd/mounts/mounts
 modules/mesh-knowledge/cmd/mesh-knowledge/mesh-knowledge
 modules/mesh-knowledge/mesh-knowledge
@@ -22,8 +22,11 @@ what it refuses.
 | `list` | optionally `status`, `owner`, `phrase`, `limit`, `severity`, `needs`, `ready`, `flag` (`delivered-not-resolved` or `abandoned`), `search` (words, ranked), `before` (a number, the cursor), `numbers` (only these issues, in the order given, naming any not an issue in `missing`), `worker` (only that worker's held issues), `linked` (only the issues with that link, as `kind:target`, such as `decision:0493`) | short rows, newest first, or best first for a `search`, or in the order given for `numbers`: number, status, owner, title, `moved` (when the issue last changed: opened, moved, noted, linked, worked on, or its fix's delivery said a new state), and each flag that holds; `next`, the `before` that reads on, when more match |
 | `move` | `number`, `status`, and what that status needs (`by` for `diagnosing` and `fixing`, optionally `take-over`) | changes the status under the development cycle's rules |
 | `note` | `number`, `text` | appends a note; a note is never edited |
-| `link` | `number`, `kind`, `target`, optionally `remove` | adds or removes a typed link |
-| `import` | optionally `dry-run`, `commit` | hq's issue folders, read through the records module, each written as an issue under its own number; see below |
+| `link` | `number`, `kind`, `target`, optionally `remove` | adds or removes a typed link; kind `milestone` (design/id, such as 47/R6) at most once per issue and only to an open milestone, kind `commit` as repository@full sha (ADR 0493 §2 to §4) |
+| `milestones` | optionally `design`, `status`, or `one` (design/id) | the milestones, in their design's table order, each with its issues and how many are done; one with its history |
+| `milestone-set` | `design`, `id`, and `outcome` to make one; optionally `order`, `announce` | makes a milestone (state `milestones`, event `milestone-set`), changes its outcome or order, or says it again |
+| `milestone-move` | `milestone`, `status` (`open` or `closed`), `reason` | opens or closes it (event `milestone-moved`); closing is refused while a linked issue is neither resolved nor wontfix |
+| `import` | optionally `dry-run`, `commit`; or `milestones` (a design's number) | hq's issue folders, read through the records module, each written as an issue under its own number; see below. With `milestones`, seeds that design's milestone records from its table once (issue 1781): an issue two rows name, or that another milestone holds, is refused and named; a milestone whose issues are all done is closed; run again, it changes nothing |
 | `set` | `number`, any of `severity`, `needs`, `suggested-owner` | changes them as a person decides |
 | `groom` | optionally `pass`, `confirm` | the triage over the backlog: without arguments a dry run in the background, answering its pass id; with `pass` its progress and findings; with `confirm` and `pass` exactly that pass's findings applied, each checked again; see below |
 | `tracking` | optionally `conditions` (condition keys) | for every condition key an issue links (link kind `condition`), the issues that link it, those not closed first: status, severity, needs, worker with since, active and stale, and where the fix is (`fix`); the operator's channel says it in a condition's message (hq ADR 0285) |
@@ -215,10 +215,18 @@ const (
 	LinkDesign      = "design"
 	LinkCondition   = "condition"
 	LinkDelivery    = "delivery"
+	// LinkMilestone is the one milestone an issue belongs to, design/id (ADR 0493 §1, §2).
+	LinkMilestone = "milestone"
+	// LinkCommit is a commit that fixes the issue, repository@full sha (ADR 0493 §4).
+	LinkCommit = "commit"
 )

 // LinkKinds is every kind, in the order they are told.
-var LinkKinds = []string{LinkDuplicates, LinkRelatesTo, LinkDependsOn, LinkPullRequest, LinkDecision, LinkDesign, LinkCondition, LinkDelivery}
+var LinkKinds = []string{LinkDuplicates, LinkRelatesTo, LinkDependsOn, LinkPullRequest, LinkDecision, LinkDesign, LinkCondition, LinkDelivery,
+	LinkMilestone, LinkCommit}
+
+// madeByPeople are the kinds only a person or a session links, never the triage (ADR 0493 §4).
+var madeByPeople = []string{LinkPullRequest, LinkMilestone, LinkCommit}

 var (
 	pullRequest = regexp.MustCompile(`^[a-z0-9][a-z0-9._-]{0,99}#[1-9][0-9]{0,6}$`)
@@ -280,6 +288,15 @@ func checkTarget(kind, target string) (string, error) {
 	case LinkDelivery:
 		ok, shape = deliveryID.MatchString(t), "a delivery's id as mesh-delivery names it: the repository as owner/name, @ and twelve "+
 			"characters of its commit, such as novox/mesh-controller@d2e9dc61590f"
+	case LinkMilestone:
+		var c string
+		c, ok = checkMilestoneTarget(t)
+		if ok {
+			t = c
+		}
+		shape = "a milestone as design/id, such as 47/R6"
+	case LinkCommit:
+		ok, shape = commitRef.MatchString(t), "a repository, @ and the commit's full 40-character id, such as mesh-catalog@"+strings.Repeat("0", 40)
 	default:
 		return "", fmt.Errorf("kind %q is not a kind of link: one of %s", kind, strings.Join(LinkKinds, ", "))
 	}
@@ -22,7 +22,8 @@ import (
 const Seat = "issue-tracker"

 // Verbs are the seat's verbs, as the manifest declares and claims them.
-var Verbs = []string{"open", "get", "list", "move", "note", "link", "import", "groom", "set", "tracking", "reserve", "fix-times"}
+var Verbs = []string{"open", "get", "list", "move", "note", "link", "milestones", "milestone-set", "milestone-move", "import",
+	"groom", "set", "tracking", "reserve", "fix-times"}

 func logf(format string, a ...any) { fmt.Fprintf(os.Stderr, format+"\n", a...) }

@@ -617,8 +618,9 @@ func Tools(t *Tracker) []stdio.Tool {
 			Description: "Link an issue to something, or with remove, take a link away. Kinds: duplicates or relates-to " +
 				"another issue (its number), pull-request (such as mesh-controller#246), decision (a decision record's " +
 				"number, such as 0275), design (a design document's path), condition (a condition's key) and delivery " +
-				"(a delivery's id, such as novox/mesh-controller@d2e9dc61590f). Refused: a target not of its kind's shape, an issue that does not exist, a link it " +
-				"already has.",
+				"(a delivery's id, such as novox/mesh-controller@d2e9dc61590f), milestone (the one milestone it belongs to, design/id such as " +
+				"47/R6) and commit (a commit that fixes it, repository@full sha). Refused: a target not of its kind's shape, an issue that does not exist, a link it " +
+				"already has, a second milestone (remove the first to move it), a milestone that does not exist or is closed.",
 			Input: schema([]string{"number", "kind", "target"}, map[string]any{
 				"number": number("the issue's number"),
 				"kind":   map[string]any{"type": "string", "enum": LinkKinds, "description": "what the target is"},
@@ -645,6 +647,98 @@ func Tools(t *Tracker) []stdio.Tool {
 				}
 				return t.link(t.callerOf(m), ask)
 			}},
+		{Name: Seat + ".milestones",
+			Description: "Read the milestones of the designs: each milestone (a design's milestone, design/id such as 47/R6) with " +
+				"its outcome, its place in the design's table, its status, who made and moved it, and the issues linked to it " +
+				"with how many are done. Narrow by design or status, or read one milestone with its history.",
+			Input: schema(nil, map[string]any{
+				"design": number("only this design's milestones, such as 47"),
+				"status": map[string]any{"type": "string", "enum": MilestoneStatuses, "description": "only milestones with this status"},
+				"one":    text("one milestone, design/id such as 47/R6, with its history"),
+			}),
+			Run: func(m map[string]any) (any, error) {
+				a, err := readArgs("milestones", m, "design", "status", "one")
+				if err != nil {
+					return nil, err
+				}
+				var ask MilestonesAsk
+				d, err := a.number("design", false)
+				if err != nil {
+					return nil, fmt.Errorf("design is a design's number, such as 47")
+				}
+				ask.Design = int(d)
+				if ask.Status, err = a.str("status"); err != nil {
+					return nil, err
+				}
+				if ask.One, err = a.str("one"); err != nil {
+					return nil, err
+				}
+				return t.milestones(ask)
+			}},
+		{Name: Seat + ".milestone-set",
+			Description: "Make a milestone of a design (its id as the design's table writes it, and its outcome), or change its " +
+				"outcome or its place in the table; with announce, say it again on the bus unchanged. Its issues are linked " +
+				"with link, kind milestone. Refused: a design that is no number, an id that is no short name, a new milestone without an outcome.",
+			Input: schema([]string{"design", "id"}, map[string]any{
+				"design":   number("the design's number, such as 47"),
+				"id":       text("the milestone's id as the table writes it, such as R6 or 3 fix"),
+				"outcome":  text("what the milestone delivers, in one line"),
+				"order":    number("its place in the design's table, first 1"),
+				"announce": map[string]any{"type": "boolean", "description": "say the milestone again on the bus, as it is"},
+			}),
+			Run: func(m map[string]any) (any, error) {
+				a, err := readArgs("milestone-set", m, "design", "id", "outcome", "order", "announce")
+				if err != nil {
+					return nil, err
+				}
+				var ask MilestoneSetAsk
+				d, err := a.number("design", true)
+				if err != nil {
+					return nil, fmt.Errorf("design is a design's number, such as 47")
+				}
+				o, err := a.number("order", false)
+				if err != nil {
+					return nil, fmt.Errorf("order is its place in the design's table, from 1")
+				}
+				ask.Design, ask.Order = int(d), int(o)
+				if ask.ID, err = a.str("id"); err != nil {
+					return nil, err
+				}
+				if ask.Outcome, err = a.str("outcome"); err != nil {
+					return nil, err
+				}
+				if ask.Announce, err = a.flag("announce"); err != nil {
+					return nil, err
+				}
+				return t.milestoneSet(t.callerOf(m), ask)
+			}},
+		{Name: Seat + ".milestone-move",
+			Description: "Open or close a milestone (design/id such as 47/R6), with the reason. Closing is refused while an " +
+				"issue linked to it is neither resolved nor wontfix, naming each; a closed milestone takes no new issue.",
+			Input: schema([]string{"milestone", "status", "reason"}, map[string]any{
+				"milestone": text("the milestone, design/id such as 47/R6"),
+				"status":    map[string]any{"type": "string", "enum": MilestoneStatuses, "description": "its new status"},
+				"reason":    text("why, in one line"),
+			}),
+			Run: func(m map[string]any) (any, error) {
+				a, err := readArgs("milestone-move", m, "milestone", "status", "reason")
+				if err != nil {
+					return nil, err
+				}
+				ref, err := a.str("milestone")
+				if err != nil {
+					return nil, err
+				}
+				status, err := a.str("status")
+				if err != nil {
+					return nil, err
+				}
+				reason, err := a.str("reason")
+				if err != nil {
+					return nil, err
+				}
+				return t.milestoneMove(t.callerOf(m), ref, status, reason)
+			}},
 		{Name: Seat + ".import",
 			Description: "Import hq's issue folders (04-ISSUES/NNN-slug/00-report.md), read through the records module at " +
 				"the commit its checkout stands at, each as an issue under its own number with the status, owners, fix " +
@@ -652,16 +746,39 @@ func Tools(t *Tracker) []stdio.Tool {
 				"the tracker holds without a status; it never overwrites an issue, never advances the counter, refuses a " +
 				"folder numbered past the counter or past the tracker's first number without an issue, and run again " +
 				"changes nothing and says so. With dry-run it writes nothing and says what it would do; with commit it " +
-				"refuses a checkout standing elsewhere. The answer is a row per folder and the counts.",
+				"refuses a checkout standing elsewhere. The answer is a row per folder and the counts. With milestones and a " +
+				"design's number it seeds that design's milestones from its milestone table instead: makes each milestone not " +
+				"made yet, links each issue the table names that is in no milestone, refuses (and names) an issue two rows name " +
+				"or another milestone holds, closes a milestone whose issues are all done, and run again changes nothing.",
 			Input: schema(nil, map[string]any{
-				"dry-run": map[string]any{"type": "boolean", "description": "read everything, write nothing, say what would be done"},
-				"commit":  text("the commit of hq the record must stand at (a prefix is enough); refused when it stands elsewhere"),
+				"dry-run":    map[string]any{"type": "boolean", "description": "read everything, write nothing, say what would be done"},
+				"milestones": number("seed this design's milestones from its milestone table, such as 47"),
+				"commit":     text("the commit of hq the record must stand at (a prefix is enough); refused when it stands elsewhere"),
 			}),
 			Run: func(m map[string]any) (any, error) {
-				a, err := readArgs("import", m, "dry-run", "commit")
+				a, err := readArgs("import", m, "dry-run", "commit", "milestones")
 				if err != nil {
 					return nil, err
 				}
+				design, err := a.number("milestones", false)
+				if err != nil {
+					return nil, fmt.Errorf("milestones is a design's number, such as 47")
+				}
+				if design != 0 {
+					dry, err := a.flag("dry-run")
+					if err != nil {
+						return nil, err
+					}
+					commit, err := a.str("commit")
+					if err != nil {
+						return nil, err
+					}
+					records := t.Records
+					if records == nil {
+						records = busRecords{}
+					}
+					return t.importMilestones(t.callerOf(m), MilestoneImportAsk{Design: int(design), DryRun: dry, Commit: commit}, records)
+				}
 				var ask ImportAsk
 				if ask.DryRun, err = a.flag("dry-run"); err != nil {
 					return nil, err
@@ -86,18 +86,18 @@ func TestItDeclaresAndHoldsTheIssueTrackerSeatOnceForTheMesh(t *testing.T) {
 		t.Fatalf("module %q, seats %+v, claims %+v", m.Module, m.Seats, m.Claims)
 	}
 	if !reflect.DeepEqual(m.Emits, []string{EventOpened, EventMoved, EventNoted, EventLinked, EventImported, EventSet,
-		EventTriaged, EventReady, EventReadyToVerify, EventReserved}) {
+		EventTriaged, EventReady, EventReadyToVerify, EventReserved, EventMilestoneSet, EventMilestoneMoved}) {
 		t.Fatalf("emits %v", m.Emits)
 	}
 	// The record is the log `changes` (ADR 0300 §1). Four states, none expiring: issues the fold of the log (§3),
 	// still keeping its older values until the carry has read them (they go to one value in a follow-up), the
 	// counters one value each, the backlog's pass of the duplicate check one value (ADR 0278 §6), each reserved
-	// number one value (issue 424).
+	// number one value (issue 424), and the milestones (issue 1781) a short history each, their trail beside their events.
 	if !reflect.DeepEqual(m.Logs, []string{ChangesLog}) {
 		t.Fatalf("logs %v", m.Logs)
 	}
 	d := m.stateDeclarations(t)
-	if len(d) != 4 || d[0].Name != IssuesState || d[0].History < 2 || d[0].TTLSeconds != 0 ||
+	if len(d) != 5 || d[4].Name != MilestonesState || d[4].History < 2 || d[4].TTLSeconds != 0 || d[0].Name != IssuesState || d[0].History < 2 || d[0].TTLSeconds != 0 ||
 		d[1].Name != CountersState || d[1].History > 1 || d[1].TTLSeconds != 0 ||
 		d[2].Name != GroomingState || d[2].History > 1 || d[2].TTLSeconds != 0 ||
 		d[3].Name != ReservationsState || d[3].History > 1 || d[3].TTLSeconds != 0 {
@@ -28,7 +28,7 @@ type memory struct {
 }

 func newMemory() *memory {
-	return &memory{data: map[string]map[string]Entry{IssuesState: {}, CountersState: {}, GroomingState: {}, ReservationsState: {}}, fail: map[string]error{},
+	return &memory{data: map[string]map[string]Entry{IssuesState: {}, CountersState: {}, GroomingState: {}, ReservationsState: {}, MilestonesState: {}}, fail: map[string]error{},
 		hist: map[string]map[string][]Entry{}}
 }

@@ -0,0 +1,441 @@
+package main
+
+// Milestones (novox/hq ADR 0493 §1 to §4, issue 1781, to-be 53 §13): each row of a design's milestone table is a record
+// of the tracker, kept in the state `milestones` under its design's number and its id. An issue's milestone is the
+// issue's own link of kind `milestone`, written in the issue's log like any link, so "an issue belongs to at most one
+// milestone" (§2) is checked inside that issue's one write. A milestone's issues are read from the issues kept.
+
+import (
+	"encoding/json"
+	"errors"
+	"fmt"
+	"regexp"
+	"sort"
+	"strconv"
+	"strings"
+	"time"
+
+	stdio "git.novox.be/novox/mesh-sdk/go"
+)
+
+const (
+	// MilestonesState keeps one milestone per key, named by MilestoneKey.
+	MilestonesState = "milestones"
+	// EventMilestoneSet is said when a milestone is made or changed, or said again on request.
+	EventMilestoneSet = "milestone-set"
+	// EventMilestoneMoved is said when a milestone's status changes.
+	EventMilestoneMoved = "milestone-moved"
+
+	MilestoneOpen   = "open"
+	MilestoneClosed = "closed"
+
+	// MostOutcome is the longest outcome a milestone keeps.
+	MostOutcome = 2048
+	// MostMilestones is the most milestones one list answers.
+	MostMilestones = 500
+)
+
+// MilestoneStatuses is every status a milestone may have. Released is added by the one ask per milestone (issue 1783).
+var MilestoneStatuses = []string{MilestoneOpen, MilestoneClosed}
+
+var (
+	milestoneID  = regexp.MustCompile(`^[A-Za-z0-9][A-Za-z0-9_-]{0,31}$`)
+	milestoneRef = regexp.MustCompile(`^([1-9][0-9]{0,2})/(.+)$`)
+	commitRef    = regexp.MustCompile(`^[a-z0-9][a-z0-9._-]{0,99}@[0-9a-f]{40}$`)
+)
+
+// Stamp is who did something and when.
+type Stamp struct {
+	By string    `json:"by"`
+	At time.Time `json:"at"`
+}
+
+// MilestoneSource is where a seeded milestone was read: hq's commit and the design's path.
+type MilestoneSource struct {
+	Commit string `json:"commit"`
+	Path   string `json:"path"`
+}
+
+// Milestone is one milestone as the tracker keeps it.
+type Milestone struct {
+	Design  int    `json:"design"`
+	ID      string `json:"id"`
+	Outcome string `json:"outcome"`
+	// Order is its place in its design's table, first 1.
+	Order    int              `json:"order"`
+	Status   string           `json:"status"`
+	Reason   string           `json:"reason,omitempty"`
+	Made     Stamp            `json:"made"`
+	Moved    *Stamp           `json:"moved,omitempty"`
+	Imported *MilestoneSource `json:"imported,omitempty"`
+}
+
+// Ref is the milestone as a link names it: design/id, such as 47/R6.
+func (m *Milestone) Ref() string { return MilestoneRef(m.Design, m.ID) }
+
+// MilestoneRef is design/id.
+func MilestoneRef(design int, id string) string { return fmt.Sprintf("%d/%s", design, id) }
+
+// MilestoneKey is a milestone's key in `milestones`: design.id, such as 47.R6.
+func MilestoneKey(design int, id string) string { return fmt.Sprintf("%d.%s", design, id) }
+
+// canonicalID is a milestone's id as kept: the table's words joined by hyphens ("3 fix" is 3-fix).
+func canonicalID(id string) (string, error) {
+	c := strings.Join(strings.Fields(id), "-")
+	if !milestoneID.MatchString(c) {
+		return "", fmt.Errorf("a milestone's id is a short name of letters, digits, - and _, such as R6 or 3-fix, not %q", id)
+	}
+	return c, nil
+}
+
+// parseMilestoneRef reads design/id, the id said the one way it is kept.
+func parseMilestoneRef(s string) (int, string, error) {
+	m := milestoneRef.FindStringSubmatch(strings.TrimSpace(s))
+	if m == nil {
+		return 0, "", fmt.Errorf("a milestone is named design/id, such as 47/R6, not %q", s)
+	}
+	d, _ := strconv.Atoi(m[1])
+	id, err := canonicalID(m[2])
+	if err != nil {
+		return 0, "", err
+	}
+	return d, id, nil
+}
+
+// checkMilestoneTarget is a milestone link's target, said the one way it is kept.
+func checkMilestoneTarget(s string) (string, bool) {
+	d, id, err := parseMilestoneRef(s)
+	if err != nil {
+		return "", false
+	}
+	return MilestoneRef(d, id), true
+}
+
+// readMilestone is a milestone and the revision it was read at; nil when there is none.
+func (t *Tracker) readMilestone(design int, id string) (*Milestone, uint64, error) {
+	e, err := t.Store.Get(MilestonesState, MilestoneKey(design, id))
+	if err != nil {
+		return nil, 0, fmt.Errorf("milestone %s cannot be read: %v", MilestoneRef(design, id), err)
+	}
+	if e == nil {
+		return nil, 0, nil
+	}
+	var m Milestone
+	if err := json.Unmarshal(e.Value, &m); err != nil {
+		return nil, 0, fmt.Errorf("milestone %s is kept in a shape the tracker cannot read: %v", MilestoneRef(design, id), err)
+	}
+	return &m, e.Revision, nil
+}
+
+// milestoneDone says an issue is done for its milestone: wontfix, or resolved with every live fix delivered.
+func milestoneDone(is *Issue) bool {
+	switch is.Status {
+	case StatusWontfix:
+		return true
+	case StatusResolved:
+		return len(liveFixes(is)) == 0 || allDelivered(is)
+	}
+	return false
+}
+
+// milestoneOf is the milestone an issue is linked to, or "".
+func milestoneOf(is *Issue) string {
+	for _, l := range is.Links {
+		if l.Kind == LinkMilestone {
+			return l.Target
+		}
+	}
+	return ""
+}
+
+// MilestoneSetAsk is what milestone-set carries.
+type MilestoneSetAsk struct {
+	Design   int
+	ID       string
+	Outcome  string
+	Order    int
+	Announce bool
+	imported *MilestoneSource
+}
+
+// MilestoneSaid is the answer to milestone-set and milestone-move.
+type MilestoneSaid struct {
+	Milestone Milestone `json:"milestone"`
+	Made      bool      `json:"made,omitempty"`
+	Changed   []string  `json:"changed,omitempty"`
+	Said      string    `json:"said"`
+	Announced bool      `json:"announced"`
+	Warning   string    `json:"warning,omitempty"`
+}
+
+// milestoneSet makes a milestone, or changes its outcome or order, at the revision read; with Announce it says the
+// record again.
+func (t *Tracker) milestoneSet(by string, a MilestoneSetAsk) (*MilestoneSaid, error) {
+	if a.Design < 1 || a.Design > 999 {
+		return nil, fmt.Errorf("design is a design's number, 1 to 999, not %d", a.Design)
+	}
+	id, err := canonicalID(a.ID)
+	if err != nil {
+		return nil, err
+	}
+	outcome := strings.TrimSpace(a.Outcome)
+	if outcome != "" {
+		if outcome, err = singleLine("outcome", outcome, MostOutcome); err != nil {
+			return nil, err
+		}
+	}
+	if a.Order < 0 {
+		return nil, fmt.Errorf("order is its place in its design's table, from 1, not %d", a.Order)
+	}
+	for attempt := 0; attempt < issueAttempts; attempt++ {
+		m, rev, err := t.readMilestone(a.Design, id)
+		if err != nil {
+			return nil, err
+		}
+		at := t.now()
+		out := &MilestoneSaid{}
+		if m == nil {
+			if outcome == "" {
+				return nil, fmt.Errorf("milestone %s does not exist; making it needs its outcome", MilestoneRef(a.Design, id))
+			}
+			m = &Milestone{Design: a.Design, ID: id, Outcome: outcome, Order: a.Order, Status: MilestoneOpen,
+				Made: Stamp{By: by, At: at}, Imported: a.imported}
+			if _, err := t.Store.Create(MilestonesState, MilestoneKey(a.Design, id), m); err != nil {
+				if errors.Is(err, stdio.ErrChanged) {
+					continue
+				}
+				return nil, fmt.Errorf("milestone %s could not be written (%v); nothing was made", m.Ref(), err)
+			}
+			out.Made = true
+			out.Said = fmt.Sprintf("Made milestone %s: %s.", m.Ref(), clipText(outcome, 120))
+		} else {
+			if outcome != "" && outcome != m.Outcome {
+				m.Outcome = outcome
+				out.Changed = append(out.Changed, "outcome")
+			}
+			if a.Order != 0 && a.Order != m.Order {
+				m.Order = a.Order
+				out.Changed = append(out.Changed, "order")
+			}
+			if len(out.Changed) == 0 && !a.Announce {
+				out.Milestone = *m
+				out.Said = fmt.Sprintf("Milestone %s already holds that; nothing changed.", m.Ref())
+				return out, nil
+			}
+			if len(out.Changed) > 0 {
+				m.Moved = &Stamp{By: by, At: at}
+				if _, err := t.Store.Update(MilestonesState, MilestoneKey(a.Design, id), m, rev); err != nil {
+					if errors.Is(err, stdio.ErrChanged) {
+						continue
+					}
+					return nil, fmt.Errorf("milestone %s could not be written (%v); nothing changed", m.Ref(), err)
+				}
+				out.Said = fmt.Sprintf("Changed the %s of milestone %s.", strings.Join(out.Changed, " and "), m.Ref())
+			} else {
+				out.Said = fmt.Sprintf("Said milestone %s again, unchanged.", m.Ref())
+			}
+		}
+		out.Milestone = *m
+		out.Announced, out.Warning = t.emit(EventMilestoneSet, map[string]any{"milestone": m.Ref(), "record": m,
+			"made": out.Made, "changed": out.Changed, "by": by, "at": at})
+		return out, nil
+	}
+	return nil, fmt.Errorf("milestone %s was changed by others %d times while this was written; nothing changed. Ask again",
+		MilestoneRef(a.Design, id), issueAttempts)
+}
+
+// milestoneMove opens or closes a milestone, with a reason. Closing is refused while an issue linked to it is neither
+// resolved nor wontfix.
+func (t *Tracker) milestoneMove(by, ref, status, reason string) (*MilestoneSaid, error) {
+	design, id, err := parseMilestoneRef(ref)
+	if err != nil {
+		return nil, err
+	}
+	if status, err = oneOf("status", status, MilestoneStatuses); err != nil {
+		return nil, err
+	}
+	if reason, err = singleLine("reason", reason, MostTitle); err != nil {
+		return nil, fmt.Errorf("a milestone is moved with its reason: %v", err)
+	}
+	if status == MilestoneClosed {
+		all, err := t.allIssues()
+		if err != nil {
+			return nil, err
+		}
+		var open []string
+		for _, n := range sortedNumbers(all) {
+			is := all[n]
+			if milestoneOf(is) == MilestoneRef(design, id) && is.Status != StatusResolved && is.Status != StatusWontfix {
+				open = append(open, fmt.Sprintf("%d (%s)", n, is.Status))
+			}
+		}
+		if len(open) > 0 {
+			return nil, fmt.Errorf("milestone %s keeps issues neither resolved nor wontfix: %s. Resolve them, or move them "+
+				"to another milestone, before it is closed", MilestoneRef(design, id), strings.Join(open, ", "))
+		}
+	}
+	for attempt := 0; attempt < issueAttempts; attempt++ {
+		m, rev, err := t.readMilestone(design, id)
+		if err != nil {
+			return nil, err
+		}
+		if m == nil {
+			return nil, fmt.Errorf("there is no milestone %s", MilestoneRef(design, id))
+		}
+		if m.Status == status {
+			return &MilestoneSaid{Milestone: *m, Said: fmt.Sprintf("Milestone %s is %s already; nothing changed.", m.Ref(), status)}, nil
+		}
+		from, at := m.Status, t.now()
+		m.Status, m.Reason, m.Moved = status, reason, &Stamp{By: by, At: at}
+		if _, err := t.Store.Update(MilestonesState, MilestoneKey(design, id), m, rev); err != nil {
+			if errors.Is(err, stdio.ErrChanged) {
+				continue
+			}
+			return nil, fmt.Errorf("milestone %s could not be written (%v); nothing changed", m.Ref(), err)
+		}
+		out := &MilestoneSaid{Milestone: *m, Changed: []string{"status"},
+			Said: fmt.Sprintf("Milestone %s moved from %s to %s: %s.", m.Ref(), from, status, reason)}
+		out.Announced, out.Warning = t.emit(EventMilestoneMoved, map[string]any{"milestone": m.Ref(), "from": from,
+			"to": status, "reason": reason, "by": by, "at": at})
+		return out, nil
+	}
+	return nil, fmt.Errorf("milestone %s was changed by others %d times while this was written; nothing changed. Ask again",
+		MilestoneRef(design, id), issueAttempts)
+}
+
+// MilestonesAsk narrows the milestones read.
+type MilestonesAsk struct {
+	Design int
+	Status string
+	// One is one milestone, design/id: answered with its history.
+	One string
+}
+
+// MilestoneRow is one milestone with its issues.
+type MilestoneRow struct {
+	Milestone
+	Ref      string         `json:"ref"`
+	Issues   []uint64       `json:"issues"`
+	ByStatus map[string]int `json:"by-status,omitempty"`
+	// Done is how many of its issues are wontfix, or resolved with their fixes delivered.
+	Done int `json:"done"`
+}
+
+// MilestonesRead is the answer to milestones.
+type MilestonesRead struct {
+	Milestones []MilestoneRow `json:"milestones"`
+	// History is every value one milestone's key keeps, oldest first, when one was asked.
+	History []json.RawMessage `json:"history,omitempty"`
+	Said    string            `json:"said"`
+}
+
+// milestones reads the milestones, ordered by design and their place in its table, each with its issues.
+func (t *Tracker) milestones(a MilestonesAsk) (*MilestonesRead, error) {
+	status := strings.TrimSpace(a.Status)
+	if status != "" {
+		var err error
+		if status, err = oneOf("status", status, MilestoneStatuses); err != nil {
+			return nil, err
+		}
+	}
+	var ms []*Milestone
+	out := &MilestonesRead{Milestones: []MilestoneRow{}}
+	if strings.TrimSpace(a.One) != "" {
+		d, id, err := parseMilestoneRef(a.One)
+		if err != nil {
+			return nil, err
+		}
+		m, _, err := t.readMilestone(d, id)
+		if err != nil {
+			return nil, err
+		}
+		if m == nil {
+			return nil, fmt.Errorf("there is no milestone %s", MilestoneRef(d, id))
+		}
+		ms = append(ms, m)
+		hist, err := t.Store.History(MilestonesState, MilestoneKey(d, id))
+		if err != nil {
+			return nil, fmt.Errorf("milestone %s's history cannot be read: %v", m.Ref(), err)
+		}
+		for _, h := range hist {
+			out.History = append(out.History, h.Value)
+		}
+	} else {
+		keys, err := t.Store.Keys(MilestonesState)
+		if err != nil {
+			return nil, fmt.Errorf("the milestones cannot be listed: %v", err)
+		}
+		for _, k := range keys {
+			ds, id, ok := strings.Cut(k, ".")
+			d, err := strconv.Atoi(ds)
+			if !ok || err != nil || (a.Design != 0 && d != a.Design) {
+				continue
+			}
+			m, _, err := t.readMilestone(d, id)
+			if err != nil {
+				return nil, err
+			}
+			if m == nil || (status != "" && m.Status != status) {
+				continue
+			}
+			ms = append(ms, m)
+		}
+	}
+	sort.Slice(ms, func(i, j int) bool {
+		if ms[i].Design != ms[j].Design {
+			return ms[i].Design < ms[j].Design
+		}
+		if ms[i].Order != ms[j].Order {
+			return ms[i].Order < ms[j].Order
+		}
+		return ms[i].ID < ms[j].ID
+	})
+	if len(ms) > MostMilestones {
+		ms = ms[:MostMilestones]
+	}
+	all, err := t.allIssues()
+	if err != nil {
+		return nil, err
+	}
+	rows := map[string]*MilestoneRow{}
+	for _, m := range ms {
+		out.Milestones = append(out.Milestones, MilestoneRow{Milestone: *m, Ref: m.Ref(), Issues: []uint64{}, ByStatus: map[string]int{}})
+	}
+	for i := range out.Milestones {
+		rows[out.Milestones[i].Ref] = &out.Milestones[i]
+	}
+	for _, n := range sortedNumbers(all) {
+		is := all[n]
+		r := rows[milestoneOf(is)]
+		if r == nil {
+			continue
+		}
+		r.Issues = append(r.Issues, n)
+		r.ByStatus[is.Status]++
+		if milestoneDone(is) {
+			r.Done++
+		}
+	}
+	out.Said = fmt.Sprintf("%d milestones.", len(out.Milestones))
+	if len(ms) == MostMilestones {
+		out.Said += fmt.Sprintf(" At most %d are answered: narrow by design.", MostMilestones)
+	}
+	return out, nil
+}
+
+// sortedNumbers is the issues' numbers, lowest first.
+func sortedNumbers(all map[uint64]*Issue) []uint64 {
+	ns := make([]uint64, 0, len(all))
+	for n := range all {
+		ns = append(ns, n)
+	}
+	sort.Slice(ns, func(i, j int) bool { return ns[i] < ns[j] })
+	return ns
+}
+
+func clipText(s string, n int) string {
+	if r := []rune(s); len(r) > n {
+		return string(r[:n-1]) + "…"
+	}
+	return s
+}
@@ -0,0 +1,84 @@
+//go:build integration
+
+package main
+
+import (
+	"encoding/json"
+	"fmt"
+	"strings"
+	"sync"
+	"testing"
+)
+
+// Issue 1781 (ADR 0493 §1, §2, §4), the module whole over a real bus: a milestone made by its verb is kept in the
+// state the manifest declares, and two instances linking one issue to two milestones at the same moment leave it in
+// exactly one; the other is refused naming the first, and the milestones and the list say the same.
+func TestAnIssueRaceIntoTwoMilestonesOverTheBusEndsInOne(t *testing.T) {
+	b := newBus(t)
+	var events []event
+	var evMu sync.Mutex
+	settings := writeSettings(t, 365)
+	one, two := b.start(t, settings, &events, &evMu), b.start(t, settings, &events, &evMu)
+	must := func(raw json.RawMessage, err error) json.RawMessage {
+		t.Helper()
+		if err != nil {
+			t.Fatal(err)
+		}
+		return raw
+	}
+	must(one.call("open", map[string]any{"title": "a milestone's issue", "report": "seen"}))
+	must(one.call("milestone-set", map[string]any{"design": 47, "id": "R6", "outcome": "nodes apply their wants", "order": 1}))
+	must(two.call("milestone-set", map[string]any{"design": 47, "id": "3 fix", "outcome": "a group merges in one pass", "order": 2}))
+	errs := make([]error, 2)
+	var wg sync.WaitGroup
+	for k, c := range []struct {
+		i      *instance
+		target string
+	}{{one, "47/R6"}, {two, "47/3-fix"}} {
+		wg.Add(1)
+		go func() {
+			defer wg.Done()
+			_, errs[k] = c.i.call("link", map[string]any{"number": 365, "kind": "milestone", "target": c.target})
+		}()
+	}
+	wg.Wait()
+	if (errs[0] == nil) == (errs[1] == nil) {
+		t.Fatalf("both or neither linked: %v", errs)
+	}
+	refused := errs[0]
+	if refused == nil {
+		refused = errs[1]
+	}
+	if !strings.Contains(refused.Error(), "is in milestone") {
+		t.Fatalf("refused with %v", refused)
+	}
+	var read MilestonesRead
+	_ = json.Unmarshal(must(two.call("milestones", map[string]any{"design": 47})), &read)
+	if len(read.Milestones) != 2 || read.Milestones[0].ID != "R6" || read.Milestones[1].ID != "3-fix" ||
+		len(read.Milestones[0].Issues)+len(read.Milestones[1].Issues) != 1 {
+		t.Fatalf("%+v", read.Milestones)
+	}
+	in := "47/R6"
+	if len(read.Milestones[1].Issues) == 1 {
+		in = "47/3-fix"
+	}
+	var l Listed
+	_ = json.Unmarshal(must(one.call("list", map[string]any{"linked": "milestone:" + in})), &l)
+	if len(l.Rows) != 1 || l.Rows[0].Number != 365 {
+		t.Fatalf("listed %+v", l)
+	}
+	var hist MilestonesRead
+	_ = json.Unmarshal(must(one.call("milestones", map[string]any{"one": "47/R6"})), &hist)
+	if len(hist.History) != 1 {
+		t.Fatalf("history %d values", len(hist.History))
+	}
+	evMu.Lock()
+	defer evMu.Unlock()
+	var kinds []string
+	for _, e := range events {
+		kinds = append(kinds, e.Key)
+	}
+	if fmt.Sprint(kinds) != "[opened milestone-set milestone-set linked]" {
+		t.Fatalf("events %v", kinds)
+	}
+}
@@ -0,0 +1,187 @@
+package main
+
+import (
+	"fmt"
+	"os"
+	"path/filepath"
+	"strings"
+	"testing"
+)
+
+// Issue 1781 (ADR 0493 §1 to §4): a milestone is a record made by its verb; an issue is linked to at most one, only to
+// an open one, and only by the verb; the triage links no milestone, pull request or commit.
+func TestAMilestoneIsMadeByItsVerbAndAnIssueBelongsToAtMostOne(t *testing.T) {
+	h := newHarness(t)
+	a, b := h.open(t, "a"), h.open(t, "b")
+	for _, c := range []struct {
+		ask  MilestoneSetAsk
+		says string
+	}{
+		{MilestoneSetAsk{Design: 0, ID: "R6", Outcome: "x"}, "design's number"},
+		{MilestoneSetAsk{Design: 47, ID: "R6/x", Outcome: "x"}, "short name"},
+		{MilestoneSetAsk{Design: 47, ID: "R6"}, "needs its outcome"},
+		{MilestoneSetAsk{Design: 47, ID: "R6", Outcome: "nodes apply their wants", Order: 2}, ""},
+		{MilestoneSetAsk{Design: 47, ID: "3 fix", Outcome: "a group merges in one pass", Order: 1}, ""},
+		{MilestoneSetAsk{Design: 47, ID: "R6", Outcome: "nodes apply their wants"}, "nothing changed"},
+	} {
+		out, err := h.milestoneSet("lead@shanks", c.ask)
+		if c.says == "" && err != nil || c.says != "" && (err == nil || !strings.Contains(err.Error(), c.says)) &&
+			(out == nil || !strings.Contains(out.Said, c.says)) {
+			t.Fatalf("%+v: want %q, got %+v %v", c.ask, c.says, out, err)
+		}
+	}
+	links := []struct {
+		l    LinkAsk
+		says string
+	}{
+		{LinkAsk{Number: a, Kind: LinkMilestone, Target: "47/R6"}, ""},
+		{LinkAsk{Number: a, Kind: LinkMilestone, Target: "47/3 fix"}, "in milestone 47/R6 already"},
+		{LinkAsk{Number: b, Kind: LinkMilestone, Target: "47/R9"}, "there is no milestone 47/R9"},
+		{LinkAsk{Number: b, Kind: LinkMilestone, Target: "R6"}, "design/id"},
+		{LinkAsk{Number: b, Kind: LinkCommit, Target: "mesh-catalog@" + strings.Repeat("a", 40)}, ""},
+		{LinkAsk{Number: b, Kind: LinkCommit, Target: "mesh-catalog@abc123"}, "full 40-character"},
+		{LinkAsk{Number: a, Kind: LinkMilestone, Target: "47/R6", Remove: true}, ""},
+		{LinkAsk{Number: a, Kind: LinkMilestone, Target: "47/3-fix"}, ""},
+		{LinkAsk{Number: b, Kind: LinkMilestone, Target: "47/R6"}, ""},
+	}
+	for _, c := range links {
+		_, err := h.link("lead@shanks", c.l)
+		if c.says == "" && err != nil || c.says != "" && (err == nil || !strings.Contains(err.Error(), c.says)) {
+			t.Fatalf("%+v: want %q, got %v", c.l, c.says, err)
+		}
+	}
+	for _, kind := range madeByPeople {
+		target := map[string]string{LinkPullRequest: "mesh-catalog#1", LinkMilestone: "47/R6", LinkCommit: "mesh-catalog@" + strings.Repeat("b", 40)}[kind]
+		if _, err := h.link(GroomBy, LinkAsk{Number: a, Kind: kind, Target: target}); err == nil || !strings.Contains(err.Error(), "triage links no") {
+			t.Fatalf("the triage linked %s: %v", kind, err)
+		}
+	}
+	read, err := h.milestones(MilestonesAsk{Design: 47})
+	if err != nil {
+		t.Fatal(err)
+	}
+	if len(read.Milestones) != 2 || read.Milestones[0].Ref != "47/3-fix" || read.Milestones[1].Ref != "47/R6" ||
+		fmt.Sprint(read.Milestones[0].Issues) != fmt.Sprint([]uint64{a}) || fmt.Sprint(read.Milestones[1].Issues) != fmt.Sprint([]uint64{b}) {
+		t.Fatalf("%+v", read.Milestones)
+	}
+	one, err := h.milestones(MilestonesAsk{One: "47/R6"})
+	if err != nil || len(one.Milestones) != 1 || len(one.History) == 0 || one.Milestones[0].Made.By != "lead@shanks" {
+		t.Fatalf("%+v %v", one, err)
+	}
+	// Closing waits for its issues; a closed milestone takes no new one; each change is said.
+	if _, err := h.milestoneMove("lead@shanks", "47/R6", MilestoneClosed, "delivered"); err == nil || !strings.Contains(err.Error(), fmt.Sprint(b)) {
+		t.Fatalf("closed over an open issue: %v", err)
+	}
+	if _, err := h.Move(MoveAsk{Number: b, Status: StatusWontfix, Reason: "not needed"}); err != nil {
+		t.Fatal(err)
+	}
+	if _, err := h.milestoneMove("lead@shanks", "47/R6", MilestoneClosed, "delivered"); err != nil {
+		t.Fatal(err)
+	}
+	if _, err := h.link("lead@shanks", LinkAsk{Number: a, Kind: LinkMilestone, Target: "47/R6", Remove: true}); err == nil {
+		t.Fatal("a removed a link it does not have")
+	}
+	c := h.open(t, "c")
+	if _, err := h.link("lead@shanks", LinkAsk{Number: c, Kind: LinkMilestone, Target: "47/R6"}); err == nil || !strings.Contains(err.Error(), "is closed") {
+		t.Fatalf("linked to a closed milestone: %v", err)
+	}
+	if out, err := h.milestoneSet("lead@shanks", MilestoneSetAsk{Design: 47, ID: "R6", Announce: true}); err != nil || !out.Announced {
+		t.Fatalf("announce: %+v %v", out, err)
+	}
+	var kinds []string
+	for _, e := range h.said() {
+		if strings.HasPrefix(e.Event, "milestone") {
+			kinds = append(kinds, e.Event+":"+fmt.Sprint(e.Body["milestone"]))
+		}
+	}
+	if strings.Join(kinds, " ") != "milestone-set:47/R6 milestone-set:47/3-fix milestone-moved:47/R6 milestone-set:47/R6" {
+		t.Fatalf("said %v", kinds)
+	}
+}
+
+// listRecords is a record holding one design document.
+type listRecords struct {
+	path, content string
+}
+
+func (r listRecords) Standing() (string, error) {
+	return "0123456789abcdef0123456789abcdef01234567", nil
+}
+func (r listRecords) List(string) ([]string, []string, error) {
+	return nil, []string{"12-other.md", filepath.Base(r.path)}, nil
+}
+func (r listRecords) Read(string) (string, string, error) { return r.content, "", nil }
+
+// Issue 1781: the seed makes each row's milestone, links what one row names, refuses what two rows name or another
+// milestone holds, closes a milestone whose issues are done, and run again changes nothing.
+func TestTheSeedTakesADesignsTableOnce(t *testing.T) {
+	h := newHarness(t)
+	a, b, c, d := h.open(t, "a"), h.open(t, "b"), h.open(t, "c"), h.open(t, "d")
+	if _, err := h.Move(MoveAsk{Number: d, Status: StatusWontfix, Reason: "folded"}); err != nil {
+		t.Fatal(err)
+	}
+	table := fmt.Sprintf("# 47 — Delivery\n\n## Milestones\n\n| # | Outcome | Issues |\n|---|---|---|\n"+
+		"| 1 | the first | %d, %d (ADR 0493 §2) |\n| 3 fix | a fix | %d, %d, 999 |\n| R4d | none yet | opened when it is prepared |\n"+
+		"| 6 | done | %d |\n\n## Next\n\n| a | Issues |\n|---|---|\n| x | %d |\n", a, b, c, b, d, a)
+	rec := listRecords{path: "03-DESIGN/01-to-be/47-delivery.md", content: table}
+	dry, err := h.importMilestones("lead@shanks", MilestoneImportAsk{Design: 47, DryRun: true}, rec)
+	if err != nil {
+		t.Fatal(err)
+	}
+	if dry.Made != 4 || dry.Linked != 3 || dry.Refused != 2 || dry.Closed != 1 || len(dry.Rows[1].Missing) != 1 {
+		t.Fatalf("dry run %+v", dry)
+	}
+	if read, _ := h.milestones(MilestonesAsk{}); len(read.Milestones) != 0 {
+		t.Fatalf("a dry run wrote %+v", read.Milestones)
+	}
+	got, err := h.importMilestones("lead@shanks", MilestoneImportAsk{Design: 47}, rec)
+	if err != nil {
+		t.Fatal(err)
+	}
+	if fmt.Sprintf("%d %d %d %d", got.Made, got.Linked, got.Refused, got.Closed) != "4 3 2 1" {
+		t.Fatalf("%+v", got)
+	}
+	read, _ := h.milestones(MilestonesAsk{Design: 47})
+	var say []string
+	for _, m := range read.Milestones {
+		say = append(say, fmt.Sprintf("%s:%s:%v", m.ID, m.Status, m.Issues))
+	}
+	if want := fmt.Sprintf("1:open:[%d] 3-fix:open:[%d] R4d:open:[] 6:closed:[%d]", a, c, d); strings.Join(say, " ") != want {
+		t.Fatalf("got %s, want %s", strings.Join(say, " "), want)
+	}
+	if read.Milestones[3].Imported == nil || read.Milestones[3].Imported.Path != rec.path {
+		t.Fatalf("%+v", read.Milestones[3])
+	}
+	again, err := h.importMilestones("lead@shanks", MilestoneImportAsk{Design: 47}, rec)
+	if err != nil || again.Made+again.Linked+again.Closed != 0 || !strings.HasPrefix(again.Said, "Changed nothing") {
+		t.Fatalf("again %+v %v", again, err)
+	}
+	if _, err := h.importMilestones("lead@shanks", MilestoneImportAsk{Design: 48}, rec); err == nil {
+		t.Fatal("seeded a design the record does not hold")
+	}
+}
+
+// Issue 1781 S1: design 47's table, as hq's branch writes it, names every issue in one row and nothing in words the
+// seed would guess.
+func TestDesign47sTableNamesEachIssueOnce(t *testing.T) {
+	raw, err := os.ReadFile(filepath.Join("testdata", "milestones", "47-delivery-from-commit-to-delivered.md"))
+	if err != nil {
+		t.Fatal(err)
+	}
+	rows, warn := parseTable(string(raw))
+	if len(rows) != 33 || len(warn) != 0 {
+		t.Fatalf("%d rows, warnings %v", len(rows), warn)
+	}
+	seen := map[uint64]string{}
+	for _, r := range rows {
+		if _, err := canonicalID(r.ID); err != nil {
+			t.Error(err)
+		}
+		for _, n := range r.Issues {
+			if other, ok := seen[n]; ok {
+				t.Errorf("issue %d is in rows %s and %s", n, other, r.ID)
+			}
+			seen[n] = r.ID
+		}
+	}
+}
@@ -0,0 +1,313 @@
+package main
+
+// The seed of a design's milestones (novox/hq issue 1781, to-be 53 §13): its `## Milestones` table, read once through
+// the records module, made into milestone records with their issues linked. The table parse moved here from the
+// knowledge base's progress (issue 1947), which reads the records since. The Issues cell is prose, so what the parse
+// cannot read for certain it says, and an issue two rows name is refused, never placed by a guess (ADR 0493 §2).
+
+import (
+	"errors"
+	"fmt"
+	"regexp"
+	"strconv"
+	"strings"
+)
+
+// DesignsFolder is where the designs being built are, in hq.
+const DesignsFolder = "03-DESIGN/01-to-be"
+
+// TableRow is one row of a design's milestone table.
+type TableRow struct {
+	ID      string
+	Outcome string
+	Issues  []uint64
+}
+
+var (
+	designFile = regexp.MustCompile(`^([0-9]{2,3})-[a-z0-9-]+\.md$`)
+	// notAnIssue is a number the Issues cell names that is not an issue: a record, a clause, a test, a release, a pull
+	// request, a document.
+	notAnIssue = regexp.MustCompile(`(?i)(ADR|research|acceptance tests?|tests?|§|clauses?|release|design|to-be|as-is|playbook|version)\s*[0-9][0-9, and]*|[a-z-]*#[0-9]+|[0-9]{4}-[0-9]{2}-[0-9]{2}|[0-9]{1,2}:[0-9]{2}`)
+	rangeWords = regexp.MustCompile(`\b([0-9]{3,5}) to ([0-9]{3,5})\b`)
+	butOne     = regexp.MustCompile(`\bbut ([0-9]{3,5})\b`)
+	issueNum   = regexp.MustCompile(`\b[0-9]{3,5}\b`)
+)
+
+// MostRange is the widest range in words the parse expands; a wider one is said and not expanded.
+const MostRange = 60
+
+// parseTable reads a design's milestone table: its rows in order, and what it could not read for certain.
+func parseTable(content string) ([]TableRow, []string) {
+	var rows []TableRow
+	var warn []string
+	lines := strings.Split(content, "\n")
+	inMilestones, header := false, -1
+	issueCol, outcomeCol := -1, -1
+	for i, raw := range lines {
+		l := strings.TrimSpace(raw)
+		if strings.HasPrefix(l, "## ") {
+			inMilestones = strings.EqualFold(strings.TrimSpace(strings.TrimPrefix(l, "## ")), "Milestones")
+			header = -1
+			continue
+		}
+		if !inMilestones || !strings.HasPrefix(l, "|") {
+			continue
+		}
+		cells := cellsOf(l)
+		if header < 0 {
+			header = i
+			issueCol, outcomeCol = -1, -1
+			for c, h := range cells {
+				switch strings.ToLower(h) {
+				case "issues", "issue":
+					issueCol = c
+				case "outcome":
+					outcomeCol = c
+				}
+			}
+			continue
+		}
+		if i == header+1 && strings.Trim(l, "|-: ") == "" {
+			continue
+		}
+		if issueCol < 0 || issueCol >= len(cells) || len(cells) == 0 {
+			continue
+		}
+		r := TableRow{ID: cells[0]}
+		if outcomeCol >= 0 && outcomeCol < len(cells) {
+			r.Outcome = cells[outcomeCol]
+		}
+		var w []string
+		r.Issues, w = issuesOf(cells[issueCol])
+		for _, x := range w {
+			warn = append(warn, fmt.Sprintf("milestone %s: %s", r.ID, x))
+		}
+		rows = append(rows, r)
+	}
+	return rows, warn
+}
+
+// issuesOf is the issue numbers a table's Issues cell names, in order, and what it could not read for certain.
+func issuesOf(cell string) ([]uint64, []string) {
+	var warn []string
+	s := notAnIssue.ReplaceAllString(cell, " ")
+	var nums []uint64
+	for _, m := range rangeWords.FindAllStringSubmatch(s, -1) {
+		lo, _ := strconv.Atoi(m[1])
+		hi, _ := strconv.Atoi(m[2])
+		if hi < lo || hi-lo > MostRange {
+			warn = append(warn, fmt.Sprintf("%q is a range in words the reader does not expand", m[0]))
+			continue
+		}
+		warn = append(warn, fmt.Sprintf("%q is a range in words, read as the %d issues %d to %d", m[0], hi-lo+1, lo, hi))
+		for n := lo; n <= hi; n++ {
+			nums = append(nums, uint64(n))
+		}
+	}
+	but := map[uint64]bool{}
+	for _, m := range butOne.FindAllStringSubmatch(s, -1) {
+		n, _ := strconv.Atoi(m[1])
+		but[uint64(n)] = true
+	}
+	s = rangeWords.ReplaceAllString(s, " ")
+	s = butOne.ReplaceAllString(s, " ")
+	for _, m := range issueNum.FindAllString(s, -1) {
+		n, _ := strconv.Atoi(m)
+		nums = append(nums, uint64(n))
+	}
+	out, have := []uint64{}, map[uint64]bool{}
+	for _, n := range nums {
+		if !have[n] && !but[n] {
+			have[n] = true
+			out = append(out, n)
+		}
+	}
+	return out, warn
+}
+
+func cellsOf(row string) []string {
+	row = strings.TrimSpace(row)
+	row = strings.TrimPrefix(row, "|")
+	row = strings.TrimSuffix(row, "|")
+	parts := strings.Split(row, "|")
+	for i := range parts {
+		parts[i] = strings.TrimSpace(parts[i])
+	}
+	return parts
+}
+
+// MilestoneImportAsk is what a seed of one design's milestones carries.
+type MilestoneImportAsk struct {
+	Design int
+	DryRun bool
+	Commit string
+}
+
+// MilestoneImportRow is what the seed did, or would do, for one row of the table.
+type MilestoneImportRow struct {
+	Milestone string   `json:"milestone"`
+	Made      bool     `json:"made,omitempty"`
+	Linked    []uint64 `json:"linked,omitempty"`
+	// Kept is the issues linked to it already.
+	Kept []uint64 `json:"kept,omitempty"`
+	// Refused is each issue not linked, and why.
+	Refused []string `json:"refused,omitempty"`
+	// Missing is the numbers the table names that are no issue.
+	Missing []uint64 `json:"missing,omitempty"`
+	Closed  bool     `json:"closed,omitempty"`
+}
+
+// MilestonesImported is the answer to a seed.
+type MilestonesImported struct {
+	DryRun   bool                 `json:"dry-run"`
+	Design   int                  `json:"design"`
+	Path     string               `json:"path"`
+	Commit   string               `json:"commit"`
+	Rows     []MilestoneImportRow `json:"rows"`
+	Made     int                  `json:"made"`
+	Linked   int                  `json:"linked"`
+	Closed   int                  `json:"closed"`
+	Refused  int                  `json:"refused"`
+	Warnings []string             `json:"warnings,omitempty"`
+	Said     string               `json:"said"`
+}
+
+// importMilestones seeds one design's milestones from its table.
+func (t *Tracker) importMilestones(by string, a MilestoneImportAsk, records Records) (*MilestonesImported, error) {
+	if a.Design < 1 || a.Design > 999 {
+		return nil, fmt.Errorf("milestones is a design's number, 1 to 999, not %d", a.Design)
+	}
+	commit, err := records.Standing()
+	if err != nil {
+		return nil, fmt.Errorf("the record cannot be read (%v); nothing was imported", err)
+	}
+	want := strings.TrimSpace(a.Commit)
+	if want != "" && !commitPrefix.MatchString(want) {
+		return nil, errors.New("commit is a commit's id or a prefix of it, 7 to 40 hex digits; nothing was imported")
+	}
+	if want != "" && !strings.HasPrefix(commit, want) {
+		return nil, fmt.Errorf("the record stands at hq commit %s, not %s: bring it up to date (records_sync), or "+
+			"name the commit it stands at. Nothing was imported", short(commit), want)
+	}
+	_, docs, err := records.List(DesignsFolder)
+	if err != nil {
+		return nil, fmt.Errorf("the record's %s cannot be listed (%v); nothing was imported", DesignsFolder, err)
+	}
+	path := ""
+	for _, d := range docs {
+		if m := designFile.FindStringSubmatch(d); m != nil {
+			if n, _ := strconv.Atoi(m[1]); n == a.Design {
+				path = DesignsFolder + "/" + d
+			}
+		}
+	}
+	if path == "" {
+		return nil, fmt.Errorf("no design %d is in %s at hq %s; nothing was imported", a.Design, DesignsFolder, short(commit))
+	}
+	content, _, err := records.Read(path)
+	if err != nil {
+		return nil, fmt.Errorf("%s cannot be read (%v); nothing was imported", path, err)
+	}
+	table, warn := parseTable(content)
+	if len(table) == 0 {
+		return nil, fmt.Errorf("%s has no milestone table with an Issues column; nothing was imported", path)
+	}
+	out := &MilestonesImported{DryRun: a.DryRun, Design: a.Design, Path: path, Commit: commit, Rows: []MilestoneImportRow{}, Warnings: warn}
+
+	// An issue two rows name is placed by nobody's guess (ADR 0493 §2).
+	rowsOf := map[uint64][]string{}
+	for _, r := range table {
+		for _, n := range r.Issues {
+			rowsOf[n] = append(rowsOf[n], r.ID)
+		}
+	}
+	all, err := t.allIssues()
+	if err != nil {
+		return nil, err
+	}
+	for i, r := range table {
+		id, err := canonicalID(r.ID)
+		if err != nil {
+			out.Warnings = append(out.Warnings, fmt.Sprintf("row %d: %v; skipped", i+1, err))
+			continue
+		}
+		ref := MilestoneRef(a.Design, id)
+		row := MilestoneImportRow{Milestone: ref}
+		m, _, err := t.readMilestone(a.Design, id)
+		if err != nil {
+			return nil, err
+		}
+		if m == nil {
+			row.Made = true
+			out.Made++
+			if !a.DryRun {
+				outcome := r.Outcome
+				if outcome == "" {
+					outcome = "(the table gives no outcome)"
+				}
+				if _, err := t.milestoneSet(by, MilestoneSetAsk{Design: a.Design, ID: id, Outcome: clipText(outcome, MostOutcome),
+					Order: i + 1, imported: &MilestoneSource{Commit: commit, Path: path}}); err != nil {
+					return nil, fmt.Errorf("%v; the rows before %s are kept, and an import run again goes on from there", err, ref)
+				}
+			}
+			m = &Milestone{Design: a.Design, ID: id, Status: MilestoneOpen}
+		}
+		var members []*Issue
+		for _, n := range r.Issues {
+			is := all[n]
+			switch {
+			case is == nil:
+				row.Missing = append(row.Missing, n)
+			case len(rowsOf[n]) > 1:
+				row.Refused = append(row.Refused, fmt.Sprintf("%d: rows %s all name it; an issue belongs to at most one", n, strings.Join(rowsOf[n], ", ")))
+			case milestoneOf(is) == ref:
+				row.Kept = append(row.Kept, n)
+				members = append(members, is)
+			case milestoneOf(is) != "":
+				row.Refused = append(row.Refused, fmt.Sprintf("%d: in milestone %s already", n, milestoneOf(is)))
+			case m.Status != MilestoneOpen:
+				row.Refused = append(row.Refused, fmt.Sprintf("%d: the milestone is %s", n, m.Status))
+			default:
+				if !a.DryRun {
+					if _, err := t.link(by, LinkAsk{Number: n, Kind: LinkMilestone, Target: ref}); err != nil {
+						row.Refused = append(row.Refused, fmt.Sprintf("%d: %v", n, err))
+						continue
+					}
+				}
+				row.Linked = append(row.Linked, n)
+				members = append(members, is)
+			}
+		}
+		out.Linked += len(row.Linked)
+		out.Refused += len(row.Refused)
+		if m.Status == MilestoneOpen && len(members) > 0 && len(row.Refused) == 0 {
+			done := true
+			for _, is := range members {
+				done = done && milestoneDone(is)
+			}
+			if done {
+				row.Closed = true
+				out.Closed++
+				if !a.DryRun {
+					if _, err := t.milestoneMove(by, ref, MilestoneClosed,
+						fmt.Sprintf("seeded closed: every issue done (hq %s)", short(commit))); err != nil {
+						return nil, err
+					}
+				}
+			}
+		}
+		out.Rows = append(out.Rows, row)
+	}
+	verb := map[bool]string{true: "Would make", false: "Made"}[a.DryRun]
+	if out.Made+out.Linked+out.Closed == 0 {
+		out.Said = fmt.Sprintf("Changed nothing: design %d's %d milestones hold what its table names", a.Design, len(out.Rows))
+	} else {
+		out.Said = fmt.Sprintf("%s %d milestones of design %d, linked %d issues and closed %d, from %s at hq %s",
+			verb, out.Made, a.Design, out.Linked, out.Closed, path, short(commit))
+	}
+	if out.Refused > 0 {
+		out.Said += fmt.Sprintf("; refused %d issues, each named in its row", out.Refused)
+	}
+	out.Said += "."
+	return out, nil
+}
@@ -7,6 +7,7 @@ import (
 	"errors"
 	"fmt"
 	"math/big"
+	"slices"
 	"sort"
 	"strings"
 	"sync"
@@ -650,6 +651,22 @@ func (t *Tracker) link(by string, a LinkAsk) (*Linked, error) {
 			}
 		}
 	}
+	if by == GroomBy && slices.Contains(madeByPeople, kind) {
+		return nil, fmt.Errorf("the triage links no %s: that link is made by the one who did the work (ADR 0493 §4)", kind)
+	}
+	if kind == LinkMilestone && !a.Remove {
+		d, id, _ := parseMilestoneRef(target)
+		m, _, err := t.readMilestone(d, id)
+		if err != nil {
+			return nil, err
+		}
+		if m == nil {
+			return nil, fmt.Errorf("there is no milestone %s: it is made from its design's table (milestone-set, or import with milestones)", target)
+		}
+		if m.Status != MilestoneOpen {
+			return nil, fmt.Errorf("milestone %s is %s: a fix found on the way joins its design's open milestone, or a milestone of its own (ADR 0493 §3)", target, m.Status)
+		}
+	}
 	at := t.now()
 	is, err := t.change(a.Number, Act{Op: EventLinked, By: by}, func(is *Issue) error {
 		for i, l := range is.Links {
@@ -665,6 +682,12 @@ func (t *Tracker) link(by string, a LinkAsk) (*Linked, error) {
 		if a.Remove {
 			return fmt.Errorf("issue %d has no %s link to %s to remove", is.Number, kind, target)
 		}
+		if kind == LinkMilestone {
+			if in := milestoneOf(is); in != "" {
+				return fmt.Errorf("issue %d is in milestone %s already, and an issue belongs to at most one (ADR 0493 §2): "+
+					"remove that link first to move it", is.Number, in)
+			}
+		}
 		if len(is.Links) >= MostLinks {
 			return fmt.Errorf("issue %d has %d links, the most one issue keeps", is.Number, MostLinks)
 		}
@@ -13,6 +13,9 @@
        "move",
        "note",
        "link",
+        "milestones",
+        "milestone-set",
+        "milestone-move",
        "import",
        "groom",
        "set",
@@ -33,6 +36,9 @@
        "move",
        "note",
        "link",
+        "milestones",
+        "milestone-set",
+        "milestone-move",
        "import",
        "groom",
        "set",
@@ -52,7 +58,9 @@
    "triaged",
    "ready",
    "ready-to-verify",
-    "reserved"
+    "reserved",
+    "milestone-set",
+    "milestone-moved"
  ],
  "consumes": [
    "mesh-issues.opened",
@@ -81,7 +89,11 @@
    },
    "counters",
    "grooming",
-    "reservations"
+    "reservations",
+    {
+      "name": "milestones",
+      "history": 5
+    }
  ],
  "config": {
    "first-number": {
@@ -27,7 +27,7 @@ operator, it is accepted only on the operator's Approve, given on a channel that
 | `import` | `dry-run`, `commit` | hq's decision records and research efforts at the commit the records module stands at, each whole at its own number |
 | `return` | `number`, `reason` | drafted clauses sent back to be drafted again; refused for a record whose clauses another record changed or links by number |
 | `withdraw` | `number`, `kind`, `why` | a reserved or proposed record withdrawn, as a new version naming why; its number stays spent. A pending review is cleared and a waiting operator's ask is ended. Refused for a record already accepted, superseded or withdrawn |
-| `progress` | `of` (`mesh`, `design <n>`, `milestone <design>/<id>`, `issue <n>`, `decision <n>` or `ADR <n>`, `research <n>`), `detail` (`minimal` or `detailed`), `bound` | how far it has come (hq issue 1947): each child done ✓, moving ▶, waiting ⏸ or stuck ✗ with when it last moved, worked out from the issue tracker's rows and mesh-delivery's deliveries and groups, never written (ADR 0424 §1). `minimal` is one line per milestone, for a report every five minutes (two or three bus calls); `detailed` the report's tree with each issue's pull requests, the groups holding them and what it depends on. Milestones are read from the design's `## Milestones` table through the records module, cached by hq's commit, until the issue tracker holds milestone records (issue 1781); what the table does not say for certain is said in `warnings` |
+| `progress` | `of` (`mesh`, `design <n>`, `milestone <design>/<id>`, `issue <n>`, `decision <n>` or `ADR <n>`, `research <n>`), `detail` (`minimal` or `detailed`), `bound` | how far it has come (hq issue 1947): each child done ✓, moving ▶, waiting ⏸ or stuck ✗ with when it last moved, worked out from the issue tracker's rows and mesh-delivery's deliveries and groups, never written (ADR 0424 §1). `minimal` is one line per milestone, for a report every five minutes (two or three bus calls); `detailed` the report's tree with each issue's pull requests, the groups holding them and what it depends on. A design's title and state are read through the records module, cached by hq's commit; its milestones and their issues are the issue tracker's milestone records (`issue-tracker.milestones`, issue 1781), asked once per answer; a design with none is refused, naming the seed (`issue-tracker.import` with `milestones`) |

 `ask`, `get`, `holds` and `history` stay within `bound` bytes (4096 unless asked for, at most 65536) and say what they cut
 and how to read the rest. The module's own tool `knowledge_health` answers its health (below).
@@ -1,15 +1,9 @@
 package main

-// A design as the progress verb reads it (novox/hq issue 1947): its title, its state as its frontmatter says it, the
-// decisions it names, and its milestones from its `## Milestones` table. Designs are still documents in hq, read
-// through the records module, until ADR 0423 makes them records of the knowledge base (issue 428); then this reads
-// those records instead.
-//
-// Milestones are read from the design's table until the issue tracker holds milestone records (ADR 0493 §1, §4,
-// built under issue 1781); when 1781 is delivered, the table reader is replaced by a read of those records and this
-// parse is deleted (the lead of design 47, 2026-10-26). The Issues cell is prose, so what the parse cannot read
-// for certain it says as a warning, never hides: an issue in two milestones (against ADR 0493 §2), a range written
-// in words, a row naming no issue.
+// A design as the progress verb reads it (novox/hq issue 1947): its title, its state as its frontmatter says it and
+// the decisions it names, read through the records module until ADR 0423 makes designs records of the knowledge base
+// (issue 428). Its milestones are the issue tracker's records (ADR 0493 §1, issue 1781), read in milestones.go: the
+// table parse that guessed them from prose moved to the tracker's seed and is gone from here.

 import (
 	"fmt"
@@ -30,31 +24,24 @@ type Design struct {
 	Status     string
 	Decisions  []string
 	Milestones []Milestone
-	Warnings   []string
 }

-// Milestone is one row of a design's milestone table.
+// Milestone is one milestone of a design, as the issue tracker keeps it.
 type Milestone struct {
 	ID      string
 	Outcome string
 	Issues  []int
+	// Status is open or closed, with its Reason; a closed milestone holding no issue is done.
+	Status string
+	Reason string
 }

 var (
 	designFile   = regexp.MustCompile(`^([0-9]{2,3})-[a-z0-9-]+\.md$`)
 	titleLine    = regexp.MustCompile(`^#\s+[0-9]+\s+[—-]\s+(.+)$`)
 	decisionItem = regexp.MustCompile(`ADR ([0-9]{4})`)
-	// notAnIssue is a number the Issues cell names that is not an issue: a record, a clause, a test, a release, a pull
-	// request, a document.
-	notAnIssue = regexp.MustCompile(`(?i)(ADR|research|acceptance tests?|tests?|§|clauses?|release|design|to-be|as-is|playbook|version)\s*[0-9][0-9, and]*|[a-z-]*#[0-9]+|[0-9]{4}-[0-9]{2}-[0-9]{2}|[0-9]{1,2}:[0-9]{2}`)
-	rangeWords = regexp.MustCompile(`\b([0-9]{3,5}) to ([0-9]{3,5})\b`)
-	butOne     = regexp.MustCompile(`\bbut ([0-9]{3,5})\b`)
-	issueNum   = regexp.MustCompile(`\b[0-9]{3,5}\b`)
 )

-// MostRange is the widest range in words the parse expands; a wider one is said and not expanded.
-const MostRange = 60
-
 // parseDesign reads a design document.
 func parseDesign(path, content string) *Design {
 	d := &Design{Path: path}
@@ -78,117 +65,14 @@ func parseDesign(path, content string) *Design {
 			}
 		}
 	}
-	inMilestones, header := false, -1
-	issueCol, outcomeCol := -1, -1
-	seen := map[int]string{}
-	for i := body; i < len(lines); i++ {
-		l := strings.TrimSpace(lines[i])
-		if d.Title == "" {
-			if m := titleLine.FindStringSubmatch(l); m != nil {
-				d.Title = strings.TrimSpace(m[1])
-			}
+	for i := body; i < len(lines) && d.Title == ""; i++ {
+		if m := titleLine.FindStringSubmatch(strings.TrimSpace(lines[i])); m != nil {
+			d.Title = strings.TrimSpace(m[1])
 		}
-		if strings.HasPrefix(l, "## ") {
-			inMilestones = strings.EqualFold(strings.TrimSpace(strings.TrimPrefix(l, "## ")), "Milestones")
-			header = -1
-			continue
-		}
-		if !inMilestones || !strings.HasPrefix(l, "|") {
-			continue
-		}
-		cells := cellsOf(l)
-		if header < 0 {
-			header = i
-			issueCol, outcomeCol = -1, -1
-			for c, h := range cells {
-				switch strings.ToLower(h) {
-				case "issues", "issue":
-					issueCol = c
-				case "outcome":
-					outcomeCol = c
-				}
-			}
-			continue
-		}
-		if i == header+1 && strings.Trim(l, "|-: ") == "" {
-			continue
-		}
-		if issueCol < 0 || issueCol >= len(cells) || len(cells) == 0 {
-			continue
-		}
-		m := Milestone{ID: cells[0]}
-		if outcomeCol >= 0 && outcomeCol < len(cells) {
-			m.Outcome = cells[outcomeCol]
-		}
-		var warn []string
-		m.Issues, warn = issuesOf(cells[issueCol])
-		for _, w := range warn {
-			d.Warnings = append(d.Warnings, fmt.Sprintf("milestone %s: %s", m.ID, w))
-		}
-		if len(m.Issues) == 0 {
-			d.Warnings = append(d.Warnings, fmt.Sprintf("milestone %s names no issue", m.ID))
-		}
-		for _, n := range m.Issues {
-			if other, ok := seen[n]; ok && other != m.ID {
-				d.Warnings = append(d.Warnings, fmt.Sprintf("issue %d is in milestones %s and %s; an issue belongs to at most one (ADR 0493 §2)", n, other, m.ID))
-				continue
-			}
-			seen[n] = m.ID
-		}
-		d.Milestones = append(d.Milestones, m)
 	}
 	return d
 }

-// issuesOf is the issue numbers a table's Issues cell names, in order, and what it could not read for certain.
-func issuesOf(cell string) ([]int, []string) {
-	var warn []string
-	s := notAnIssue.ReplaceAllString(cell, " ")
-	var nums []int
-	for _, m := range rangeWords.FindAllStringSubmatch(s, -1) {
-		lo, _ := strconv.Atoi(m[1])
-		hi, _ := strconv.Atoi(m[2])
-		if hi < lo || hi-lo > MostRange {
-			warn = append(warn, fmt.Sprintf("%q is a range in words the reader does not expand", m[0]))
-			continue
-		}
-		warn = append(warn, fmt.Sprintf("%q is a range in words, read as the %d issues %d to %d", m[0], hi-lo+1, lo, hi))
-		for n := lo; n <= hi; n++ {
-			nums = append(nums, n)
-		}
-	}
-	but := map[int]bool{}
-	for _, m := range butOne.FindAllStringSubmatch(s, -1) {
-		n, _ := strconv.Atoi(m[1])
-		but[n] = true
-	}
-	s = rangeWords.ReplaceAllString(s, " ")
-	s = butOne.ReplaceAllString(s, " ")
-	for _, m := range issueNum.FindAllString(s, -1) {
-		n, _ := strconv.Atoi(m)
-		nums = append(nums, n)
-	}
-	out, have := []int{}, map[int]bool{}
-	for _, n := range nums {
-		if !have[n] && !but[n] {
-			have[n] = true
-			out = append(out, n)
-		}
-	}
-	return out, warn
-}
-
-func cellsOf(row string) []string {
-	row = strings.TrimSpace(row)
-	row = strings.TrimPrefix(row, "|")
-	row = strings.TrimSuffix(row, "|")
-	parts := strings.Split(row, "|")
-	for i := range parts {
-		parts[i] = strings.TrimSpace(parts[i])
-	}
-	return parts
-}
-
 func lastPart(p string) string {
 	if i := strings.LastIndex(p, "/"); i >= 0 {
 		return p[i+1:]
@@ -196,11 +80,12 @@ func lastPart(p string) string {
 	return p
 }

-// milestone finds a milestone by its id, as the table writes it, without regard to case or spaces.
+// milestone finds a milestone by its id, without regard to case, or to spaces against hyphens.
 func (d *Design) milestone(id string) *Milestone {
-	want := strings.ToLower(strings.Join(strings.Fields(id), " "))
+	// The tracker keeps an id's words joined by hyphens (3 fix is 3-fix); either is taken.
+	want := strings.ToLower(strings.Join(strings.Fields(id), "-"))
 	for i := range d.Milestones {
-		if strings.ToLower(strings.Join(strings.Fields(d.Milestones[i].ID), " ")) == want {
+		if strings.ToLower(strings.Join(strings.Fields(d.Milestones[i].ID), "-")) == want {
 			return &d.Milestones[i]
 		}
 	}
@@ -1129,9 +1129,8 @@ func Tools(k *KB, caller func(map[string]any) string) []stdio.Tool {
 				"and never written by anyone, with when it last moved. detail minimal (the default) gives one line per " +
 				"milestone, cheap enough for a report every five minutes; detailed gives the report's tree: each " +
 				"milestone not done with its issues, their pull requests, the groups holding them and what each waits " +
-				"for, for about every thirty. Milestones are read from the design's milestone table until the issue " +
-				"tracker holds milestone records (issue 1781); what the table does not say for certain is said in " +
-				"warnings. Within a bound it states, 4 KiB unless asked for more, saying what it cut.",
+				"for, for about every thirty. A design's milestones and their issues are the issue tracker's milestone " +
+				"records (its milestones); a design with none is refused, naming the seed. Within a bound it states, 4 KiB unless asked for more, saying what it cut.",
 			Input: schema([]string{"of"}, map[string]any{
 				"of": text("what: mesh, design 47, milestone 47/R6, issue 1945, decision 493 (or ADR 0493) or research 72"),
 				"detail": map[string]any{"type": "string", "enum": []string{DetailMinimal, DetailDetailed},
@@ -80,11 +80,11 @@ func TestItDeclaresAndHoldsTheKnowledgeBaseSeatOnceForTheMesh(t *testing.T) {
 	}
 	if !reflect.DeepEqual(m.Invokes, []string{"seat:issue-tracker.reserve", "claude-code.claude_code_judge", "claude-code.claude_code_judged", "records.records_status",
 		"records.records_list", "records.records_read", "seat:operator-channel.notify", "seat:issue-tracker.list", "seat:issue-tracker.get",
-		"seat:mesh-delivery.deliveries", "seat:mesh-delivery.show", "seat:mesh-delivery.groups"}) {
+		"seat:issue-tracker.milestones", "seat:mesh-delivery.deliveries", "seat:mesh-delivery.show", "seat:mesh-delivery.groups"}) {
 		t.Fatalf("invokes %v", m.Invokes)
 	}
 	src := ""
-	for _, f := range []string{"main.go", "hq.go", "progress.go"} {
+	for _, f := range []string{"main.go", "hq.go", "progress.go", "milestones.go"} {
 		src += readFile(t, f)
 	}
 	for _, inv := range m.Invokes {
@@ -0,0 +1,53 @@
+package main
+
+// A design's milestones are records of the issue tracker (novox/hq ADR 0493 §1, issue 1781): progress asks
+// `issue-tracker.milestones` once per answer, on the bus, for each milestone with its issues, instead of reading the
+// design's table through the records module.
+
+import (
+	"encoding/json"
+	"fmt"
+)
+
+// MilestonesVerb is the tracker's verb that answers the milestones.
+const MilestonesVerb = "seat:issue-tracker.milestones"
+
+// trackerMilestone is a row of `issue-tracker.milestones`.
+type trackerMilestone struct {
+	Design  int    `json:"design"`
+	ID      string `json:"id"`
+	Outcome string `json:"outcome"`
+	Status  string `json:"status"`
+	Reason  string `json:"reason"`
+	Issues  []int  `json:"issues"`
+}
+
+// withMilestones is each design with its milestones as the tracker holds them, in their table's order; design 0 asks
+// every design's. The designs are copies: the cache keeps what hq says, never what the tracker said.
+func (k *KB) withMilestones(ds []*Design, design int) ([]*Design, error) {
+	body := map[string]any{}
+	if design != 0 {
+		body["design"] = design
+	}
+	raw, err := k.Seats(MilestonesVerb, body)
+	if err != nil {
+		return nil, fmt.Errorf("the issue tracker does not answer its milestones: %v", err)
+	}
+	var l struct {
+		Milestones []trackerMilestone `json:"milestones"`
+	}
+	if err := json.Unmarshal(raw, &l); err != nil {
+		return nil, fmt.Errorf("issue-tracker.milestones answered something else: %v", err)
+	}
+	by := map[int][]Milestone{}
+	for _, m := range l.Milestones {
+		by[m.Design] = append(by[m.Design], Milestone{ID: m.ID, Outcome: m.Outcome, Issues: m.Issues, Status: m.Status, Reason: m.Reason})
+	}
+	out := make([]*Design, 0, len(ds))
+	for _, d := range ds {
+		c := *d
+		c.Milestones = by[d.Number]
+		out = append(out, &c)
+	}
+	return out, nil
+}
@@ -5,8 +5,9 @@ package main
 // level, in two forms: minimal, one line per child, cheap enough for every five minutes; detailed, the tree of a
 // lead's report with the pull requests, the held groups and what waits on whom, for about every thirty.
 //
-// It keeps no state of its own. It reads, each a request and reply over the bus: the designs through the records
-// module (design.go, cached by hq's commit), the issues from the issue tracker (`issue-tracker.list`, whose rows
+// It keeps no state of its own. It reads, each a request and reply over the bus: the designs' titles and states through
+// the records module (design.go, cached by hq's commit), their milestones from the issue tracker (milestones.go,
+// issue 1781), the issues from the issue tracker (`issue-tracker.list`, whose rows
 // say each issue's delivery and when it last moved), and the deliveries and groups from mesh-delivery.

 import (
@@ -287,6 +288,9 @@ func milestoneItems(d *Design, rows map[int]trackerRow, missing map[int]bool) ([
 			}
 		}
 		rollUp(&mi, kids)
+		if m.Status == "closed" && len(kids) == 0 {
+			mi.State, mi.Why = StateDone, "closed: "+m.Reason
+		}
 		mi.Children = kids
 		items = append(items, mi)
 	}
@@ -303,9 +307,15 @@ func (k *KB) progressDesign(p *Progress, number int, milestone string) error {
 	if err != nil {
 		return err
 	}
+	if ds, err = k.withMilestones(ds, number); err != nil {
+		return err
+	}
 	d := ds[0]
-	p.Source = fmt.Sprintf("the milestone table of %s at hq %s (until the tracker's milestone records, issue 1781)", d.Path, short(commit))
-	p.Warnings = append(p.Warnings, d.Warnings...)
+	if len(d.Milestones) == 0 {
+		return fmt.Errorf("design %d has no milestone records in the issue tracker: seed them from its table with "+
+			"issue-tracker.import milestones %d", number, number)
+	}
+	p.Source = fmt.Sprintf("the issue tracker's milestone records of design %d, and %s at hq %s", number, d.Path, short(commit))
 	ms := d
 	if milestone != "" {
 		m := d.milestone(milestone)
@@ -354,7 +364,10 @@ func (k *KB) progressMesh(p *Progress) error {
 	if err != nil {
 		return err
 	}
-	p.Source = fmt.Sprintf("the designs in %s at hq %s", DesignsFolder, short(commit))
+	if ds, err = k.withMilestones(ds, 0); err != nil {
+		return err
+	}
+	p.Source = fmt.Sprintf("the issue tracker's milestone records, and the designs in %s at hq %s", DesignsFolder, short(commit))
 	var with []*Design
 	var without []string
 	for _, d := range ds {
@@ -12,12 +12,12 @@ import (
 )

 // 1947/AC1: the knowledge base running whole, as the runtime launches it, answers progress over the bus: it reads
-// design 47 through the records module and asks the issue tracker and mesh-delivery on their seats' subjects,
+// design 47 through the records module, its milestones from the issue tracker (issue 1781), and asks the issue tracker and mesh-delivery on their seats' subjects,
 // played here from what the live seats answered (testdata/progress).
 func TestProgressOverTheBus(t *testing.T) {
 	w := newBusWorld(t)
 	seats := newSeatsWorld(t)
-	for _, key := range []string{"seat:issue-tracker.list", "seat:issue-tracker.get", "seat:mesh-delivery.deliveries",
+	for _, key := range []string{"seat:issue-tracker.list", "seat:issue-tracker.get", MilestonesVerb, "seat:mesh-delivery.deliveries",
 		"seat:mesh-delivery.groups", "seat:mesh-delivery.show"} {
 		key := key
 		if _, err := w.nc.Subscribe("ask."+key, func(m *nats.Msg) {
@@ -45,7 +45,7 @@ func TestProgressOverTheBus(t *testing.T) {
 	}
 	lines := strings.Split(p.Tree, "\n")
 	if len(raw) > DefaultBound || p.Detail != DetailMinimal || !strings.HasPrefix(lines[0], "✗ design 47 · Delivery: from a commit to delivered — ") ||
-		!strings.Contains(p.Tree, "✗ R6  4/7  1945 fixing since") || !strings.Contains(strings.Join(p.Warnings, "\n"), "issue 1209 is in milestones R3b and R3c") {
+		!strings.Contains(p.Tree, "✗ R6  4/7  1945 fixing since") || !strings.Contains(p.Source, "the issue tracker's milestone records of design 47") {
 		t.Fatalf("%d bytes:\n%s\n%v", len(raw), p.Tree, p.Warnings)
 	}
 	raw, err = b.call(Seat+".progress", map[string]any{"of": "milestone 47/R6", "detail": "detailed"})
@@ -63,7 +63,7 @@ func TestProgressOverTheBus(t *testing.T) {
 	}
 	seats.mu.Lock()
 	defer seats.mu.Unlock()
-	if seats.asked["seat:issue-tracker.list"] != 2 || seats.asked["seat:mesh-delivery.groups"] != 1 {
+	if seats.asked["seat:issue-tracker.list"] != 2 || seats.asked["seat:mesh-delivery.groups"] != 1 || seats.asked[MilestonesVerb] != 2 {
 		t.Fatalf("asked %v", seats.asked)
 	}
 }
@@ -45,8 +45,10 @@ type seatsWorld struct {
 	mu     sync.Mutex
 	rows   map[int]json.RawMessage
 	linked map[string][]int
-	asked  map[string]int
-	files  map[string]json.RawMessage
+	// milestones is the tracker's milestone records (issue 1781).
+	milestones json.RawMessage
+	asked      map[string]int
+	files      map[string]json.RawMessage
 }

 func newSeatsWorld(t *testing.T) *seatsWorld {
@@ -61,6 +63,7 @@ func newSeatsWorld(t *testing.T) *seatsWorld {
 		_ = json.Unmarshal(r, &n)
 		s.rows[n.Number] = r
 	}
+	s.milestones = readFixture(t, "tracker-milestones-47.json")
 	for _, f := range []string{"deliveries.json", "groups.json", "show-car-hunter-2.json"} {
 		s.files[f] = readFixture(t, f)
 	}
@@ -86,9 +89,15 @@ func (s *seatsWorld) ask(key string, body any) (json.RawMessage, error) {
 		Linked  string `json:"linked"`
 		Number  int    `json:"number"`
 		ID      string `json:"id"`
+		Design  int    `json:"design"`
 	}
 	_ = json.Unmarshal(raw, &a)
 	switch key {
+	case MilestonesVerb:
+		if a.Design != 0 && a.Design != 47 {
+			return json.RawMessage(`{"milestones": []}`), nil
+		}
+		return s.milestones, nil
 	case "seat:issue-tracker.list":
 		numbers := a.Numbers
 		if a.Linked != "" {
@@ -131,31 +140,37 @@ func (c *countingRecords) Read(p string) (string, string, error) {
 	return content, c.commit, err
 }

-// 1947/AC2: the milestone table of design 47, as hq holds it, read into milestones with their issues, and what the
-// prose does not say for certain said as warnings.
-func TestTheDesignReaderReadsTheMilestoneTable(t *testing.T) {
+// 1947/AC2, as issue 1781 changed it: a design's title, state and decisions are hq's; its milestones are the issue
+// tracker's records, ordered as its table, an id found with spaces or hyphens, and a closed one holding no issue done.
+func TestADesignsMilestonesAreTheTrackersRecords(t *testing.T) {
 	content, _, err := progressRecords().Read(DesignsFolder + "/47-delivery-from-commit-to-delivered.md")
 	if err != nil {
 		t.Fatal(err)
 	}
 	d := parseDesign(DesignsFolder+"/47-delivery-from-commit-to-delivered.md", content)
-	if d.Number != 47 || d.Title != "Delivery: from a commit to delivered" || d.Status != "in-progress" || !contains(d.Decisions, "ADR 0276") {
-		t.Fatalf("design %d %q %q %v", d.Number, d.Title, d.Status, d.Decisions)
+	if d.Number != 47 || d.Title != "Delivery: from a commit to delivered" || d.Status != "in-progress" || !contains(d.Decisions, "ADR 0276") ||
+		len(d.Milestones) != 0 {
+		t.Fatalf("design %d %q %q %v, %d milestones read from hq", d.Number, d.Title, d.Status, d.Decisions, len(d.Milestones))
 	}
-	if len(d.Milestones) != 29 {
-		t.Fatalf("%d milestones", len(d.Milestones))
+	seats := newSeatsWorld(t)
+	k := &KB{Seats: seats.ask}
+	ds, err := k.withMilestones([]*Design{d}, 47)
+	if err != nil {
+		t.Fatal(err)
+	}
+	if len(ds[0].Milestones) != 29 || len(d.Milestones) != 0 || seats.asked[MilestonesVerb] != 1 {
+		t.Fatalf("%d milestones; the cached design holds %d", len(ds[0].Milestones), len(d.Milestones))
 	}
 	for _, c := range []struct {
 		id   string
 		want []int
 	}{
 		{"1", []int{973, 525}},
-		{"2b", []int{1025, 1019}},
 		{"R6", []int{1942, 1945, 1943, 1944, 1946, 1906, 1130}},
 		{"r4d", []int{}},
 		{"3 fix", []int{1082, 1049, 1047, 1083, 1079, 1084}},
 	} {
-		m := d.milestone(c.id)
+		m := ds[0].milestone(c.id)
 		if m == nil {
 			t.Fatalf("no milestone %s", c.id)
 		}
@@ -163,25 +178,10 @@ func TestTheDesignReaderReadsTheMilestoneTable(t *testing.T) {
 			t.Errorf("milestone %s: %v, want %v", c.id, m.Issues, c.want)
 		}
 	}
-	if r4a := d.milestone("R4a"); len(r4a.Issues) != 14 || !containsInt(r4a.Issues, 1360) {
-		t.Errorf("R4a's range 1353 to 1364 read as %v", r4a.Issues)
-	}
-	warned := strings.Join(d.Warnings, "\n")
-	for _, w := range []string{"issue 1209 is in milestones R3b and R3c", "issue 971 is in milestones 6 and R4c",
-		`"1353 to 1364" is a range in words, read as the 12 issues`, "milestone R4d names no issue"} {
-		if !strings.Contains(warned, w) {
-			t.Errorf("no warning %q in\n%s", w, warned)
-		}
-	}
-	// Design 57's range with an exception, and a design with no milestone table.
-	content, _, _ = progressRecords().Read(DesignsFolder + "/57-building-config-and-provisioning.md")
-	d57 := parseDesign(DesignsFolder+"/57-building-config-and-provisioning.md", content)
-	if m := d57.milestone("1"); m == nil || containsInt(m.Issues, 659) || !containsInt(m.Issues, 678) || !containsInt(m.Issues, 685) {
-		t.Errorf("design 57 milestone 1: %+v", d57.Milestones)
-	}
-	content, _, _ = progressRecords().Read(DesignsFolder + "/53-the-issue-tracker.md")
-	if d53 := parseDesign(DesignsFolder+"/53-the-issue-tracker.md", content); len(d53.Milestones) != 0 || d53.Status != "in-progress" {
-		t.Errorf("design 53: %+v", d53.Milestones)
+	closed := &Design{Milestones: []Milestone{{ID: "6", Status: "closed", Reason: "folded into release 4"}, {ID: "R4d", Status: "open"}}}
+	items, _ := milestoneItems(closed, nil, nil)
+	if items[0].State != StateDone || items[1].State != StateWaiting {
+		t.Fatalf("%+v", items)
 	}
 }

@@ -207,8 +207,8 @@ func TestDesignsAreReadAgainOnlyWhenHqMoves(t *testing.T) {
 	if rec.reads != 3 {
 		t.Fatalf("read %d documents for the mesh, want 3", rec.reads)
 	}
-	if !strings.Contains(p.Tree, "3 designs in progress, 2 with milestones") || !strings.Contains(p.Tree, "design 47 · Delivery: from a commit to delivered") ||
-		!strings.Contains(p.Tree, "1 designs in progress name no milestones (issue 845): 53") {
+	if !strings.Contains(p.Tree, "3 designs in progress, 1 with milestones") || !strings.Contains(p.Tree, "design 47 · Delivery: from a commit to delivered") ||
+		!strings.Contains(p.Tree, "2 designs in progress name no milestones (issue 845): 53, 57") {
 		t.Fatalf("mesh:\n%s", p.Tree)
 	}
 	for range 2 {
@@ -303,7 +303,7 @@ func TestProgressOfADesignMinimalAndDetailed(t *testing.T) {
 		t.Fatal(err)
 	}
 	raw, _ := json.Marshal(p)
-	if len(raw) > DefaultBound || p.Detail != DetailMinimal || !strings.Contains(p.Source, "issue 1781") {
+	if len(raw) > DefaultBound || p.Detail != DetailMinimal || !strings.Contains(p.Source, "the issue tracker's milestone records of design 47") {
 		t.Fatalf("%d bytes, %s, %s", len(raw), p.Detail, p.Source)
 	}
 	if seats.asked["seat:issue-tracker.list"] != 1 || seats.asked["seat:mesh-delivery.deliveries"] != 0 || seats.asked["seat:issue-tracker.get"] != 0 {
@@ -316,7 +316,7 @@ func TestProgressOfADesignMinimalAndDetailed(t *testing.T) {
 	if !strings.HasPrefix(lines[0], "✗ design 47 · Delivery: from a commit to delivered — ") {
 		t.Fatalf("first line %q", lines[0])
 	}
-	for _, want := range []string{"✗ R6  4/7  1945 fixing since", "✗ 3 fix  0/1  1049 fixing, worker fix-chain-cat@shanks stale since"} {
+	for _, want := range []string{"✗ R6  4/7  1945 fixing since", "✗ 3-fix  0/1  1049 fixing, worker fix-chain-cat@shanks stale since"} {
 		if !strings.Contains(p.Tree, want) {
 			t.Errorf("no %q in\n%s", want, p.Tree)
 		}
@@ -346,7 +346,7 @@ func TestProgressOfADesignMinimalAndDetailed(t *testing.T) {
 	if raw, _ := json.Marshal(small); len(raw) > LeastBound || !strings.Contains(small.Cut, "raise bound") {
 		t.Fatalf("%d bytes within %d; cut %q", len(raw), LeastBound, small.Cut)
 	}
-	for _, bad := range []ProgressAsk{{Of: "design"}, {Of: "milestone 47/R99"}, {Of: "design 47", Detail: "full"}} {
+	for _, bad := range []ProgressAsk{{Of: "design"}, {Of: "milestone 47/R99"}, {Of: "design 47", Detail: "full"}, {Of: "design 57"}} {
 		if _, err := k.Progress(bad); err == nil {
 			t.Errorf("%+v was answered", bad)
 		}
@@ -5,3 +5,6 @@ Captured for the progress verb's tests (novox/hq issue 1947), never written by h
  2026-10-26 16:2x (before rows said `moved`).
 - `deliveries.json`, `groups.json`, `show-car-hunter-2.json`: parts of `mesh-delivery.deliveries`, `.groups` and
  `.show` as the live delivery seat answered them on 2026-10-26 16:2x, cut to the members named here.
+- `tracker-milestones-47.json`: the answer of `issue-tracker.milestones` for design 47 (issue 1781), made by running
+  the tracker's own table parse (mesh-issues `parseTable`, its seed) over `hq/`'s design 47, each issue two rows name
+  left in neither, as the seed refuses it; the tracker held no milestone records yet to capture from.
@@ -0,0 +1,418 @@
+{
+  "milestones": [
+    {
+      "design": 47,
+      "id": "1",
+      "issues": [
+        973,
+        525
+      ],
+      "order": 1,
+      "outcome": "A merge during a running delivery is never dropped and needs no person's release; the merge window lives on the bus; a rollout that shares nothing with an open one runs beside it",
+      "ref": "47/1",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "2",
+      "issues": [
+        974,
+        975,
+        976
+      ],
+      "order": 2,
+      "outcome": "A ready mark is acted on within seconds, and each pull request has at most one waiting check",
+      "ref": "47/2",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "2b",
+      "issues": [
+        1025,
+        1019
+      ],
+      "order": 3,
+      "outcome": "build-agent and route-proxy live whole in mesh-controller (ADR 0420, accepted 2026-10-17): the controller accepts a reviewed move, mesh-delivery announces each merge with its Approve, and the two modules move; built as two releases before the rule that a milestone is one release",
+      "ref": "47/2b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "3",
+      "issues": [
+        977,
+        978,
+        1022,
+        895,
+        1046,
+        605,
+        1021
+      ],
+      "order": 4,
+      "outcome": "A feature with a new seat verb across the controller and the catalogue is one group, one batch, one delivery plan and one Approve: no order lines, no ready mark, each module built and sent once",
+      "ref": "47/3",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "4",
+      "issues": [
+        980,
+        1065,
+        1066,
+        1067,
+        1068
+      ],
+      "order": 5,
+      "outcome": "A delivery backs up the data it moves first, and a failed backup holds it and is said",
+      "ref": "47/4",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "3-fix",
+      "issues": [
+        1082,
+        1049,
+        1047,
+        1083,
+        1079,
+        1084
+      ],
+      "order": 6,
+      "outcome": "A group approved together merges in one pass and goes out in one delivery plan, also when its members' tests read each other's repositories",
+      "ref": "47/3-fix",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "5",
+      "issues": [
+        981
+      ],
+      "order": 7,
+      "outcome": "One read of a module on a node names the commit, build and rollout that put it there",
+      "ref": "47/5",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "5b",
+      "issues": [
+        1117,
+        1124,
+        1128
+      ],
+      "order": 8,
+      "outcome": "Decided: building and delivering leave the controller for parts that watch and write keys in the repository `mesh-delivery`, landing in six releases (ADR 0429); the forge module makes that repository from its config, protected before any team reaches it (ADR 0428)",
+      "ref": "47/5b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "6",
+      "issues": [],
+      "order": 9,
+      "outcome": "Folded into release 4 by ADR 0429 §10 (the fetch over SSH in R4c, the cut-over in R4e): installed toolchains, builders fetching over SSH with their own key, and an SDK change shipping with its users are built in the builder's new home, so the builder is changed once",
+      "ref": "47/6",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R1a",
+      "issues": [
+        1131
+      ],
+      "order": 10,
+      "outcome": "The node-engine, the controller and the parts can read one layout of the have, presence, pulse and stuck keys: mesh-sdk ships it before its users",
+      "ref": "47/R1a",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R1b",
+      "issues": [
+        1132,
+        1142,
+        1136,
+        1145,
+        1146,
+        1147,
+        1160,
+        1162
+      ],
+      "order": 11,
+      "outcome": "Every node writes what it runs of each module, on its own keys and nobody else's, and the bus says to one part when a connection opens and closes",
+      "ref": "47/R1b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R1c",
+      "issues": [
+        1134,
+        1137
+      ],
+      "order": 12,
+      "outcome": "The operator sees every module on every node, with its build, phase and health, in `mesh-delivery-cli` (aliased `nox-delivery`) and its web view",
+      "ref": "47/R1c",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R2a",
+      "issues": [
+        1153
+      ],
+      "order": 13,
+      "outcome": "The watchman and the controller can read one layout of the stuck keys: mesh-sdk ships it before its users",
+      "ref": "47/R2a",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R2b",
+      "issues": [
+        1135,
+        1154,
+        1155,
+        1156,
+        1157,
+        1159
+      ],
+      "order": 14,
+      "outcome": "A part, node or check that stops moving is raised as a condition within two minutes, with no timer in a part",
+      "ref": "47/R2b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R2c",
+      "issues": [
+        1183
+      ],
+      "order": 15,
+      "outcome": "The controller says when it last heard each machine from presence alone, and no longer hears the alive message",
+      "ref": "47/R2c",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R2d",
+      "issues": [
+        1158
+      ],
+      "order": 16,
+      "outcome": "The node-engine sends no alive message",
+      "ref": "47/R2d",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R3a",
+      "issues": [
+        1200,
+        1201,
+        1202,
+        1203,
+        1204,
+        1208
+      ],
+      "order": 17,
+      "outcome": "The gate, the bridge, the indexer and the teller can read one layout of the source revision, candidates, modules, merges, asks, answers, owed acts, forge messages and conditions, and one function computes the source fingerprint: mesh-sdk ships them before their users (ADR 0437)",
+      "ref": "47/R3a",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R3b",
+      "issues": [
+        1210,
+        1211,
+        1212,
+        1213,
+        1214,
+        1215,
+        1216,
+        1217,
+        1218
+      ],
+      "order": 18,
+      "outcome": "The controller finds the delivery seat's holder by its claim and records each build's fingerprint inputs; the router takes conditions on their one subject; the operator sees no change (ADR 0437)",
+      "ref": "47/R3b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R3c",
+      "issues": [
+        1235,
+        1236,
+        1237,
+        1238,
+        1239,
+        1240,
+        1241,
+        1234,
+        1223,
+        1233,
+        1242
+      ],
+      "order": 19,
+      "outcome": "The forge bridge, the indexer and the teller run beside today's mesh-delivery and write their keys; the view shows modules against the controller's source fingerprints; nothing is merged by them yet (ADR 0437)",
+      "ref": "47/R3c",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R3d",
+      "issues": [
+        1321,
+        1322,
+        1323,
+        1324,
+        1325,
+        1326,
+        1317,
+        1314,
+        1315,
+        1316
+      ],
+      "order": 20,
+      "outcome": "The gate's keys can carry what the forge needs and the controller answers a what-if as data, so the gate has what it reads before it runs; a failed delivery plan asks the operator Retry on the phone, and a seat whose holder is assigned nowhere passes to its only claimant; the operator sees only the Retry notice (ADR 0450, ADR 0449)",
+      "ref": "47/R3d",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R3e",
+      "issues": [],
+      "order": 21,
+      "outcome": "A group reaches the mesh as one source revision written by the gate; the merge's Approve is asked by the teller and answered on the phone until issue 953; the view shows the open asks; today's module mesh-delivery is carried over into the gate when it first holds the seat and ends; no step needs the operator's terminal (ADR 0437, ADR 0450)",
+      "ref": "47/R3e",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4a",
+      "issues": [
+        1353,
+        1354,
+        1355,
+        1356,
+        1357,
+        1358,
+        1359,
+        1360,
+        1361,
+        1362,
+        1363,
+        1364,
+        1298,
+        1308
+      ],
+      "order": 22,
+      "outcome": "The shared layouts of release 4 are on mesh-sdk's main before their users pin them: the catalogue, the validator and the composition over a plain input, the fingerprint's new form, and the key layouts of the builder, the checker, the kept verdicts, the manifests and the candidates; the node-engine reports the user namespaces capability (ADR 0453 clauses 1, 2, 3)",
+      "ref": "47/R4a",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4b",
+      "issues": [
+        1375,
+        1337
+      ],
+      "order": 23,
+      "outcome": "mesh-controller and the node-engine use the catalogue, the validator and the composition from mesh-sdk and delete their copies; the controller composes every node both ways on the live facts and the two agree before this is delivered; it writes the grants and credential bindings the assigner reads; its unit level meets its bound (ADR 0453 clauses 1, 3)",
+      "ref": "47/R4b",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4c",
+      "issues": [
+        1309,
+        1287,
+        1288,
+        1289,
+        1290,
+        1291,
+        1292,
+        1251,
+        1293
+      ],
+      "order": 24,
+      "outcome": "The new parts run dark beside today's: the indexer writes the manifests by digest and the fingerprints in the new form beside today's (its own, first delivery), then the build modules (the Go build module, the Node and TypeScript build module: toolchain, sandbox, fetch, digest, test, build), the builder, the checker writing `mesh/check` as a status the forge does not require, and the assigner's composition check writing into the checker's report; the build seat's accounts are decided by a record before the build modules' pull requests are opened (ADR 0453 clauses 4, 6, 7, 8, 11, 12, 16; ADR 0465 §4); the builder is ADR 0478's. It is delivered in ADR 0465 §5's order: mesh-sdk's layouts; the forge bridge and the indexer with the controller's facts in format 2; the build modules; the builder; the checker; the bus user list's composer moved into mesh-sdk; the assigner's composition check; the fetch and run steps. The build modules each run as an account of their own with a forge key known read-only on one forge user (ADR 0466); each builds with the node's installed toolchain at the agreed version and does not refuse on a node with another (ADR 0477, issue 1572), answers a long step with its id and finishes it on a key, is called on a named machine, and runs on the four nodes that run the build agent today (ADR 0469)",
+      "ref": "47/R4c",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4d",
+      "issues": [],
+      "order": 25,
+      "outcome": "Four modules stop being built from a Dockerfile: route-proxy, nats, n8n and mail's autoconfiguration module (automx, replaced by a Go program), each rework its own release step, nats in a delivery of its own; free between R4a and R4e and never in the same delivery as another release (ADR 0452, ADR 0453 clauses 13, 14, 16)",
+      "ref": "47/R4d",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4e",
+      "issues": [
+        1304
+      ],
+      "order": 26,
+      "outcome": "The controller asks no build: a build is keyed by its fingerprint, the new form becomes the only one as one group, and a merge builds nothing its check built; builders fetch over SSH, so an SDK change ships with its users; the vendored copies leave mesh-controller and mesh-sdk; delivered only once the builder's artifact digests equal build-agent's (ADR 0453 clauses 2, 4, 5, 6)",
+      "ref": "47/R4e",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4f",
+      "issues": [
+        709,
+        1300,
+        1301,
+        1302
+      ],
+      "order": 27,
+      "outcome": "A pull request carries one required status that says what it proved and how long each part took; the controller's composition check and its replays are deleted with the two old statuses; the controller's deletions R3e makes possible go; each level's times are measured, and a bound fails a repository from the first check that meets it (ADR 0447, ADR 0450 §8, ADR 0453 clauses 4, 9, 10)",
+      "ref": "47/R4f",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R4g",
+      "issues": [
+        1887,
+        1295,
+        1296,
+        1303
+      ],
+      "order": 28,
+      "outcome": "The last milestone of release 4 and release 5 as one, with one switch-over and no rehearsal (ADR 0524 §1): builds and checks are asks on streams that each build node pulls when it has a free slot, deliveries first, with nothing holding checks and no controller queue (ADR 0525); the assigner is made with its composition check, writes each node's wants compared with what the controller sends and every difference, and the view answers the asks that need no proof of who answered (ADR 0528, ADR 0437 §10); no module's fingerprint takes the builder (ADR 0530); the scripts of the repositories a module is built from, build-agent with its socket and Dockerfile code, the toolchain images and the controller's build code go, and the builder delivers its own module, the build modules and the controller from its keys (ADR 0453 clauses 5, 8, 10; ADR 0524 §5, §7); the ways to deliver without the builder are recorded (ADR 0526); hq's four checks are Go tests (ADR 0527); each repository's script goes (ADR 0529); the word for the composition check's predecessor is struck. Its pull requests are opened only after five readings, the revert path read, not shown on a test merge (ADR 0524 §3)",
+      "ref": "47/R4g",
+      "status": "open"
+    },
+    {
+      "design": 47,
+      "id": "R6",
+      "issues": [
+        1942,
+        1945,
+        1943,
+        1944,
+        1946,
+        1906,
+        1130
+      ],
+      "order": 29,
+      "outcome": "Each node applies from its wants the compositions its own node agent composes (ADR 0547 §2; as released it applied the controller's signed ones), a new version reaches the module's canary first and the rest once it is healthy there, a move a person must allow is asked before its want, the view says what is moving, settled, stuck and delivered, and the plans are deleted from the code; switched over by release 5's last plan (ADR 0539)",
+      "ref": "47/R6",
+      "status": "open"
+    }
+  ],
+  "said": "generated"
+}
@@ -87,6 +87,7 @@
    "seat:operator-channel.notify",
    "seat:issue-tracker.list",
    "seat:issue-tracker.get",
+    "seat:issue-tracker.milestones",
    "seat:mesh-delivery.deliveries",
    "seat:mesh-delivery.show",
    "seat:mesh-delivery.groups"