From bf0a6c0f95633d565b760eb21acf00d19b82448d Mon Sep 17 00:00:00 2001 From: Claude Date: Tue, 17 Nov 2026 03:36:04 +0000 Subject: [PATCH] Research tree register (branches, gates, owners, pruned history) Co-Authored-By: Claude Opus 5.5 --- docs/claude/research-tree.md | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 docs/claude/research-tree.md diff --git a/docs/claude/research-tree.md b/docs/claude/research-tree.md new file mode 100644 index 000000000..b1562986a --- /dev/null +++ b/docs/claude/research-tree.md @@ -0,0 +1,28 @@ +# MeltMind research tree (Claude maintains it, single writer; started 2026-11-17) + +Method (Yanqi): explore many branches; none has to succeed. Each branch gets a cheap gate, learns something and is pruned or expanded. Every probe, counter-example and prune reason is kept here. Goal: state-of-the-art fill prediction. + +Rules: +- A branch starts with a **gate**: the cheapest test that could prune it (about 2 CPU-h or less, or existing outputs only). Gate criteria are written down before the run. +- Statuses: OPEN, PROBING, PRUNED (with reason), PROMOTED (gets a contract), PARKED. +- Every result records what we learned, even when the result is negative. +- At most 2 promoted branches run at a time; gates can run in parallel on free cores. +- Single writer per execution root (MeltAstra on Horsea). One review from Claude per contract. + +| ID | Branch | Gate (cheapest falsifier) | Owner | Status | +|---|---|---|---|---| +| B1 | H1: residual on the eikonal volume map (t* - cF, same 19 features) | full run is cheap (<= 20 CPU-h) | spec Mold, run Melt | PROMOTED | +| B2 | H2: geometry-aware operator on the H1 target | pilot <= 2 GPU-h with a cost gate | spec MeltAssist, run Melt | PROMOTED (after the B1 contract) | +| B3 | Arrival-field topology: dry-region H0(-T) maxima and saddles as last-fill / front-meeting diagnostics | on about 50 parts, compute the diagnostics from the true T and from the full-node EIK; check whether they are stable and whether EIK's critical points match the truth | spec Mold, run Melt | OPEN | +| B4 | Filling as a filtration: one scalar potential plus a monotone time map | oracle: the best per-part monotone map from the EIK potential to the true T; the remaining error is ordering error that no time map can fix | Mold / Melt | OPEN | +| B5 | Sheet / paired-wall decomposition on real meshes | scope a relaxed general-domain certificate on paper; then try 10 Greif parts and report coverage and false connections | Mold, then Melt | OPEN | +| B6 | Intrinsic coordinates (Laplace-Beltrami / spectral) as features | 50 parts: does a spectral feature explain A's residual (partial correlation on the learning folds only)? | MeltAssist lit, Melt run | OPEN | +| B7 | Order-aware objective (pairwise or rank loss) instead of pointwise L2 | small GBRT ranker on one fold: Kendall tau and last-fill location against A | MeltAssist / Melt | OPEN | +| B8 | Fresh hold-out from Greif v2 (42 parts, 40 new source tokens) | read-only LOG/YML, field validity and near-duplicate check | MeltAssist | OPEN | +| B9 | Heat transfer / packing targets (cooling time, shrinkage) | read-only inventory of v4/v5 fields | MeltAssist | OPEN | +| P1 | O2 local tensor readings | — | — | PRUNED (S1, S2, S3-A: no gain on the current recipe) | +| P2 | Own graph flow-competition solver | — | — | PRUNED (infeasible: splu resource stop, GMRES numerical failure; the idea itself is untested) | +| P3 | O1 with size-matched K = 8 partitions | — | — | PRUNED (eligibility 23 %; lesson: control cut area as a covariate, do not match it) | + +Log (newest first): +- 2026-11-17: tree started; B1/B2 promoted on Yanqi's approval; B3-B9 opened.