Private stock policy

Apply a local vendor inventory and policy to every route leaf without sending the route or stock data to a service:

renkin audit-route route.json \
  --private-stock private-vendors.csv \
  --stock-policy private-policy.json \
  --output json

The vendor table requires smiles and accepts id, vendor, price, lead_time_days, hazard, and available. The policy is versioned JSON:

{
  "schema_version": 1,
  "source_label": "internal-catalog",
  "source_revision": "2026-08-31",
  "allowed_vendors": ["Acme"],
  "blocked_vendors": ["Legacy"],
  "max_price": 100.0,
  "max_lead_time_days": 14,
  "blocked_hazards": ["flammable", "acute-toxic"],
  "require_available": true,
  "blocked_smiles": []
}

Each leaf is classified as matched, rejected, or unknown. Rejections carry a stable reason such as vendor_not_allowed, price_limit_exceeded, lead_time_exceeded, hazard_blocked, not_available, or prohibited_substance. A missing exact vendor record is unknown; salt-, stereo-, and tautomer-relaxed vendor matches do not silently become exact stock identity.

hazard is an optional local catalog label. Matching is exact and case-sensitive so each organization can define its own controlled vocabulary.

When multiple exact records satisfy the policy, the report selects one deterministically: lowest known price, then shortest known lead time, then vendor and catalog ID. This makes the selected offer reproducible without uploading the vendor table.

For multi-route reports, route_score adds a deterministic planning signal: routes are ranked first by fewer rejected leaves, then fewer unknown leaves, fewer matched leaves with missing prices, lower known-price total, and shorter maximum lead time. The rank is advisory and does not replace structural or forward-validation status.

The output includes the policy source and a SHA-256 digest of the policy in audit_manifest.private_stock_policy_sha256. The vendor table itself is not uploaded or embedded in the report.

Route cost constraint

When planning with --constraints, set max_route_cost to keep only routes whose computed route_cost is at or below the limit:

{
  "max_route_cost": 25.0,
  "require_reaction_families": ["suzuki_coupling"],
  "avoid_reaction_families": ["heck_reaction"],
  "avoid_building_blocks": ["Brc1ccccc1"],
  "require_building_blocks": ["c1ccccc1"]
}

With --bb-prices, the limit uses the supplied price-map units. Without a price map, it uses RENKIN's existing SA-score-based route-cost estimate. The boundary is inclusive; missing price entries continue to use the documented fallback and are not treated as free.

require_reaction_families is a hard route filter: every returned route must contain at least one step whose recorded reaction family matches one of the listed names. prefer_reaction_families remains an ordering preference and does not remove routes. avoid_reaction_families is also a hard filter and removes any route containing a listed family.

avoid_building_blocks is an exact leaf filter. Values must be canonical SMILES matching the route's building_blocks entries; matching leaves cause the route to be excluded. This keeps private inventory and prohibited-material decisions local without changing the shared stock file.

require_building_blocks is the complementary house-stock filter: a route must contain at least one matching canonical leaf. Both filters are evaluated after search and do not alter legacy unconstrained search behavior.