feat: D24 fact intervals (--as-of) and bin/stack assistant helpers.

Store valid_from/valid_to on leafs and filter search by calendar day without
overloading D16 source staleness; stack start/start-assistant wires brain + PicoClaw.

internal/brain/rank/args.go

@@ -5,10 +5,11 @@ import (
 	"strconv"
 
 	"github.com/eSlider/2dph/internal/cli"
+	"github.com/eSlider/2dph/internal/facts"
 	"github.com/integrii/flaggy"
 )
 
-const Usage = `usage: bin/brain/search.go "query" [--root facts|info] [--repo REPO] [-n N] [--hop N] [--json] [--no-web]
+const Usage = `usage: bin/brain/search.go "query" [--root facts|info] [--repo REPO] [-n N] [--hop N] [--as-of YYYY-MM-DD] [--json] [--no-web]
        bin/brain/search.go serve [port]
        bin/brain/search.go --list-model
        source <(./bin/cli/complete.go bash)`
@@ -19,6 +20,7 @@ type Options struct {
 	Repo      string
 	Limit     int
 	Hop       int
+	AsOf      string
 	JSONOut   bool
 	ListModel bool
 	NoWeb     bool
@@ -35,6 +37,7 @@ func NewParser(opt *Options) *flaggy.Parser {
 	p.String(&opt.Repo, "", "repo", "filter by repo")
 	p.Int(&opt.Limit, "n", "n", "max hits")
 	p.Int(&opt.Hop, "", "hop", "walk FROM_FILE depth 1-3")
+	p.String(&opt.AsOf, "", "as-of", "keep facts active on YYYY-MM-DD (D24)")
 	p.Bool(&opt.JSONOut, "", "json", "JSON output")
 	p.Bool(&opt.NoWeb, "", "no-web", "stay local")
 	p.Bool(&opt.ListModel, "", "list-model", "print embedding model")
@@ -64,6 +67,13 @@ func ParseArgs(args []string) (Options, error) {
 	if opt.Hop > 3 {
 		return opt, fmt.Errorf("--hop max is 3 (File → Commit → Person)")
 	}
+	if opt.AsOf != "" {
+		day := facts.NormalizeDay(opt.AsOf)
+		if len(day) != 10 || day[4] != '-' || day[7] != '-' {
+			return opt, fmt.Errorf("--as-of must be YYYY-MM-DD, got %q", opt.AsOf)
+		}
+		opt.AsOf = day
+	}
 	if opt.Query == "" && !opt.ListModel {
 		return opt, fmt.Errorf("no query given")
 	}

internal/brain/rank/asof_test.go

@@ -0,0 +1,34 @@
+package rank
+
+import "testing"
+
+func TestFilterAsOfKeepsXDropsY(t *testing.T) {
+	hits := []Hit{
+		{ID: "x", Text: "Andrey works at X", ValidFrom: "2024-03-01", ValidTo: "2025-07-15"},
+		{ID: "y", Text: "Andrey works at Y", ValidFrom: "2025-07-16", ValidTo: ""},
+		{ID: "legacy", Text: "always true claim", ValidFrom: "", ValidTo: ""},
+	}
+	out := FilterAsOf(hits, "2025-01-01")
+	if len(out) != 2 {
+		t.Fatalf("len=%d want 2: %+v", len(out), out)
+	}
+	if out[0].ID != "x" || out[1].ID != "legacy" {
+		t.Fatalf("got %+v", out)
+	}
+	if FilterAsOf(hits, "") == nil || len(FilterAsOf(hits, "")) != 3 {
+		t.Fatal("empty as-of must keep all")
+	}
+}
+
+func TestParseArgsAsOf(t *testing.T) {
+	opt, err := ParseArgs([]string{"who works where", "--as-of", "2025-01-01", "--json"})
+	if err != nil {
+		t.Fatal(err)
+	}
+	if opt.AsOf != "2025-01-01" {
+		t.Fatalf("AsOf=%q", opt.AsOf)
+	}
+	if _, err := ParseArgs([]string{"q", "--as-of", "not-a-date"}); err == nil {
+		t.Fatal("expected bad as-of error")
+	}
+}

internal/brain/rank/query.go

@@ -3,10 +3,12 @@ package rank
 // BM25 ranks best-first, so the top hits are the *highest* scores; cosine
 // distance ranks best-first ascending. Both mirror kblib.py.
 const FTSStmt = "CALL QUERY_FTS_INDEX('Leaf', 'id', $q) " +
-	"RETURN node.id, node.text, node.root, node.source, score, node.confidence ORDER BY score DESC LIMIT $n"
+	"RETURN node.id, node.text, node.root, node.source, score, node.confidence, " +
+	"node.valid_from, node.valid_to ORDER BY score DESC LIMIT $n"
 
 const VecStmt = "CALL QUERY_VECTOR_INDEX('Leaf', 'Leaf_vec', $q, $n) " +
-	"RETURN node.id, node.text, node.root, node.source, distance, node.confidence ORDER BY distance LIMIT $n"
+	"RETURN node.id, node.text, node.root, node.source, distance, node.confidence, " +
+	"node.valid_from, node.valid_to ORDER BY distance LIMIT $n"
 
 // HopStmt is the Cypher walk from a search hit. Depth 1 = File, 2 = Commit, 3 = Person.
 func HopStmt(depth int) string {

internal/brain/rank/rank.go

@@ -5,6 +5,8 @@ package rank
 import (
 	"sort"
 	"strings"
+
+	"github.com/eSlider/2dph/internal/facts"
 )
 
 type HopNode struct {
@@ -23,17 +25,24 @@ type Hit struct {
 	Source     string    `json:"-"`
 	Score      float64   `json:"score"`
 	Snippet    string    `json:"snippet,omitempty"`
+	ValidFrom  string    `json:"valid_from,omitempty"`
+	ValidTo    string    `json:"valid_to,omitempty"`
 	Hops       []HopNode `json:"hops,omitempty"`
 }
 
 // rrfK dampens the contribution of low ranks; same constant as kblib.py.
 const rrfK = 60
 
-// RankAndFilter fuses the two hit lists, applies --root/--repo, then cuts to
-// limit. Cutting first dropped every matching leaf ranked below the cut, so
-// `--root facts` came back empty whenever info leafs filled the top N.
-// limit <= 0 keeps everything.
+// RankAndFilter fuses the two hit lists, applies --root/--repo/--as-of, then
+// cuts to limit. Cutting first dropped every matching leaf ranked below the
+// cut, so `--root facts` came back empty whenever info leafs filled the top N.
+// limit <= 0 keeps everything. asOf empty skips interval filter (D24).
 func RankAndFilter(fts, vec []Hit, root, repo string, limit int) []Hit {
+	return RankAndFilterAsOf(fts, vec, root, repo, "", limit)
+}
+
+// RankAndFilterAsOf is RankAndFilter with D24 fact-interval filter.
+func RankAndFilterAsOf(fts, vec []Hit, root, repo, asOf string, limit int) []Hit {
 	out := Hybrid(fts, vec, 0)
 	if root != "" {
 		out = FilterRoot(out, root)
@@ -41,12 +50,30 @@ func RankAndFilter(fts, vec []Hit, root, repo string, limit int) []Hit {
 	if repo != "" {
 		out = FilterRepo(out, repo)
 	}
+	if asOf != "" {
+		out = FilterAsOf(out, asOf)
+	}
 	if limit > 0 && len(out) > limit {
 		out = out[:limit]
 	}
 	return out
 }
 
+// FilterAsOf keeps hits whose [valid_from, valid_to] covers asOf (D24).
+// Empty intervals stay (legacy leafs). Empty asOf keeps all.
+func FilterAsOf(hits []Hit, asOf string) []Hit {
+	if asOf == "" {
+		return hits
+	}
+	var out []Hit
+	for _, h := range hits {
+		if facts.ActiveAt(h.ValidFrom, h.ValidTo, asOf) {
+			out = append(out, h)
+		}
+	}
+	return out
+}
+
 // Hybrid merges FTS and vector hits by reciprocal rank fusion.
 // limit <= 0 returns the full fused list.
 func Hybrid(fts, vec []Hit, limit int) []Hit {