renkin 0.61.0 → 1.0.0

package/README.md

@@ -414,7 +414,7 @@ for the full acceptance criteria and licensing split.
 | **Route scoring** | `confidence`, `step_confidence`, `success_probability` (Retro-prob style), `convergency`, `atom_economy`, `route_cost` (`Σ BB cost + steps×0.5`, or actual prices via `--bb-prices`/`--stock`) per step/route — see caveat below the table |
 | **Step metadata provenance** | Each step reports `metadata_source`/`metadata_scope` so it's machine-readable whether `conditions`/`reaction_family` came from a rule-author default vs. something more grounded; absent (not fabricated) for extracted templates |
 | **Pareto multi-objective search** | `--format pareto` returns a Pareto front across `route_cost`/`success_probability`/`steps`; objectives configurable via `--objectives` |
-| **Constraint DSL** | `--constraints constraints.json` — element filters, step limits, confidence thresholds, preferred reaction families; enables LLM → RENKIN pipelines |
+| **Constraint DSL** | `--constraints constraints.json` — element/building-block filters, step/cost limits, confidence thresholds, required/avoided/preferred reaction families; enables LLM → RENKIN pipelines |
 | **Output formats & diagnostics** | `--format json\|tree\|mermaid\|explain\|compare\|compare-json\|pareto`; zero-route JSON includes a `diagnostics` block with `likely_causes`/`suggestions` |
 | **`renkin-forward` toolkit** | `predict` (rank forward products), `enumerate` (bounded products from one reactant + partner library), `hints` (partner-free retrieval hints, no concrete product), `validate` (forward-verify each retro step) — see the [Forward guides](docs/guides/forward-retrieval-hints.md#predict--enumerate--hints-at-a-glance) |
 | **`renkin-bench`** | USPTO-50k/PaRoutes evaluation with `--plausibility` (forward-validated composite score), `--failure-taxonomy`, atom-balance checks (`target_MW > Σ precursor_MW`), and multi-stage `cascade` re-runs on unsolved targets — see [Benchmark](#benchmark) |
@@ -565,7 +565,7 @@ The JSON output includes `avg_nodes_expanded`, `avg_confidence`, `avg_convergenc
 | `validate_route` | Forward-validate a retrosynthetic route |
 | `explain_route` | Human-readable strengths/weaknesses per route |
 | `find_pareto_routes` | Pareto-front multi-objective route search |
-| `plan_with_constraints` | Constraint-DSL planning (element filters, step limits, confidence thresholds) |
+| `plan_with_constraints` | Constraint-DSL planning (element/building-block filters, step/cost limits, confidence thresholds, required/avoided/preferred reaction families) |
 | `estimate_diversity` | Route diversity and coverage metrics |
 
 `find_routes` also accepts `search_mode: "coverage"` with a required
@@ -713,8 +713,15 @@ see "Earlier milestones" below for older shipped work.
 ### Next
 
 - [x] Graph rule expansion — sulfonamide and carbamate cleavage (one PR per family, with structural and atom-accounting gates; carbamate shipped v0.61.0)
-- [ ] Urea cleavage — define and validate an atom-balanced disconnection before adding a default rule
+- [x] Urea cleavage — validated atom-balanced disconnection to isocyanate + amine; implemented locally as the next-version candidate (not published)
 - [ ] Stock-aware planning (price / hazard / availability re-ranking)
+  - [x] Deterministic policy-aware vendor-offer selection (price, lead time,
+    availability) for exact private-stock matches
+  - [x] Optional local hazard labels and blocked-hazard policy decisions
+  - [x] Route-level stock score and deterministic multi-route ranking metadata
+  - [x] Constraint DSL route-cost cap (`max_route_cost`) with explicit route-cost semantics
+  - [x] Exact canonical building-block exclusion (`avoid_building_blocks`) for private/constrained stock policies
+  - [x] Exact canonical building-block requirement (`require_building_blocks`) for house-stock policies
 
 <details>
 <summary>Earlier milestones</summary>

package/package.json

@@ -5,7 +5,7 @@
     "kent-tokyo <kent-tokyo@users.noreply.github.com>"
   ],
   "description": "Ultra-fast retrosynthesis engine for computer-aided synthesis planning (CASP) — pure Rust, WASM-ready, Python bindings via PyO3",
-  "version": "0.61.0",
+  "version": "1.0.0",
   "license": "MIT",
   "repository": {
     "type": "git",

package/renkin.d.ts

@@ -138,6 +138,16 @@ export function find_routes_v4(target: string, depth: number, max_routes: number
  */
 export function find_routes_v5(target: string, depth: number, max_routes: number, beam_width: number, avoid_elements: string, require_elements: string, spectator_bond_policy: string, element_accounting_policy: string, beam_diversity_policy: string, beam_diversity_slots: number): string;
 
+/**
+ * Same as [`find_routes_v5`], plus bounded candidate-level diagnostics.
+ * `candidate_trace_limit` is an explicit collection cap; `0` collects no
+ * records while still returning the aggregate `search_diagnostics` block.
+ * The diagnostics are read-only and do not affect route selection. A new
+ * export preserves the fail-loud compatibility behavior of the earlier
+ * versioned WASM functions.
+ */
+export function find_routes_v6(target: string, depth: number, max_routes: number, beam_width: number, avoid_elements: string, require_elements: string, spectator_bond_policy: string, element_accounting_policy: string, beam_diversity_policy: string, beam_diversity_slots: number, candidate_trace_limit: number): string;
+
 /**
  * Return the crate version string.
  */
@@ -155,6 +165,7 @@ export interface InitOutput {
     readonly find_routes_v3: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number) => [number, number];
     readonly find_routes_v4: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number) => [number, number];
     readonly find_routes_v5: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number) => [number, number];
+    readonly find_routes_v6: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number, i: number, j: number, k: number, l: number, m: number, n: number, o: number, p: number, q: number) => [number, number];
     readonly version: () => [number, number];
     readonly __wbindgen_externrefs: WebAssembly.Table;
     readonly __wbindgen_malloc: (a: number, b: number) => number;

package/renkin.js

@@ -328,6 +328,51 @@ export function find_routes_v5(target, depth, max_routes, beam_width, avoid_elem
     }
 }
 
+/**
+ * Same as [`find_routes_v5`], plus bounded candidate-level diagnostics.
+ * `candidate_trace_limit` is an explicit collection cap; `0` collects no
+ * records while still returning the aggregate `search_diagnostics` block.
+ * The diagnostics are read-only and do not affect route selection. A new
+ * export preserves the fail-loud compatibility behavior of the earlier
+ * versioned WASM functions.
+ * @param {string} target
+ * @param {number} depth
+ * @param {number} max_routes
+ * @param {number} beam_width
+ * @param {string} avoid_elements
+ * @param {string} require_elements
+ * @param {string} spectator_bond_policy
+ * @param {string} element_accounting_policy
+ * @param {string} beam_diversity_policy
+ * @param {number} beam_diversity_slots
+ * @param {number} candidate_trace_limit
+ * @returns {string}
+ */
+export function find_routes_v6(target, depth, max_routes, beam_width, avoid_elements, require_elements, spectator_bond_policy, element_accounting_policy, beam_diversity_policy, beam_diversity_slots, candidate_trace_limit) {
+    let deferred7_0;
+    let deferred7_1;
+    try {
+        const ptr0 = passStringToWasm0(target, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len0 = WASM_VECTOR_LEN;
+        const ptr1 = passStringToWasm0(avoid_elements, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len1 = WASM_VECTOR_LEN;
+        const ptr2 = passStringToWasm0(require_elements, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len2 = WASM_VECTOR_LEN;
+        const ptr3 = passStringToWasm0(spectator_bond_policy, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len3 = WASM_VECTOR_LEN;
+        const ptr4 = passStringToWasm0(element_accounting_policy, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len4 = WASM_VECTOR_LEN;
+        const ptr5 = passStringToWasm0(beam_diversity_policy, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc);
+        const len5 = WASM_VECTOR_LEN;
+        const ret = wasm.find_routes_v6(ptr0, len0, depth, max_routes, beam_width, ptr1, len1, ptr2, len2, ptr3, len3, ptr4, len4, ptr5, len5, beam_diversity_slots, candidate_trace_limit);
+        deferred7_0 = ret[0];
+        deferred7_1 = ret[1];
+        return getStringFromWasm0(ret[0], ret[1]);
+    } finally {
+        wasm.__wbindgen_free(deferred7_0, deferred7_1, 1);
+    }
+}
+
 /**
  * Return the crate version string.
  * @returns {string}