dfa7e00bd0
- woodcutting-f2p.yaml v5: prepare state (a2-a9 check/withdraw/GE-buy/wait/collect/equip-or-carry/loadout -> travel), unobtainable axe -> failed (never complete), chopping->drop_logs gated to afk-xp, per-row chop/walk/respawn/log_price constants, mode rates = canonical top-row reference, woodcutting_fixtures (level-1 / level-50 quest+no-quest / level-70 / level-30 profiles), drop-mode realized GP 0 - schemas/entry.schema.json: ladder rows require per-row rate fields; model slimmed to drop/deposit/break; woodcutting_fixtures block added - tools/validate.py: port woodcutting gates onto the economy validator (select_ladder_row + row_rates recompute fixtures at 27/28 capacity, drop-GP-zero gate, prepare/failed/drop-gating wiring checks); selftest now 55 checks
1565 lines
88 KiB
Python
1565 lines
88 KiB
Python
#!/usr/bin/env python3
|
|
"""OSRS Codex validator — the gate for every codex/**.yaml entry.
|
|
|
|
Runs:
|
|
1. JSON-Schema validation (schemas/entry.schema.json)
|
|
2. Cross-field consistency checks the schema can't express:
|
|
- state_machine `next`/transition targets must be declared states
|
|
- `initial` must be a declared state
|
|
- duplicate action ids / step names
|
|
- status:verified entries with `verified:` older than --stale-days
|
|
=> WARNING (entry should be re-verified, not dropped)
|
|
- `best_practice` lines whose source starts with "researched"
|
|
=> WARNING (citation TODO — file a follow-up issue)
|
|
- GE-margin entries (tags include flipping and/or merchanting —
|
|
the unambiguous margin signals): the 2% GE convenience fee is
|
|
rounded DOWN to whole coins per item and capped at 5,000,000 GP
|
|
per item, so net_per_cycle MUST equal
|
|
income - min(floor(0.02*income), 5_000_000) - cost.
|
|
Fractional-tax arithmetic (0.98*sell - buy) and uncapped tax
|
|
(6M on a 300M sale) are errors.
|
|
NOTE: the generic `ge` tag alone does NOT gate this rule — a
|
|
training/processing/procurement entry may legitimately carry
|
|
`ge` while its income/cost model has nothing to do with flip tax.
|
|
- GE-flip lifecycle (flipping/merchanting entries): the 4h buy-limit
|
|
ledger (limit_used / limit_resets_at) is DISTINCT from offer
|
|
expiry — a limit-window reset never cancels an offer and cancelling
|
|
never renews the limit; every slot is an independent asynchronous
|
|
sub-state machine (canonical set: free / buy-open /
|
|
buy-filled-awaiting-collect / buy-cancelled-awaiting-collect /
|
|
ready-to-sell / sell-open / sell-filled-awaiting-collect /
|
|
sell-cancelled-awaiting-collect / ready-to-requote / closed) driven
|
|
by a global scheduler pass that never touches unrelated slots;
|
|
ge_cancel moves filled items, refunded CASH, unsold units and
|
|
proceeds to the GE collection box for a separate ge_collect;
|
|
per-slot conservation is SIDE-AWARE (buy: quoted units =
|
|
filled + still_open + cancelled_unfilled and acquired items =
|
|
filled ONLY — the unfilled/cancelled quantity is cash, never
|
|
refunded units; sell: quoted = sold + still_open + returned_unsold)
|
|
with phase gates (a full buy cannot sell before collection, a full
|
|
sell cannot close before proceeds collection);
|
|
closed has ONE outgoing transition — the archival release
|
|
``closed -> free`` — so a completed cycle's physical GE slot
|
|
returns to free for the next flip instead of stranding forever
|
|
(governor 10471); the two-rotation reuse regression proves a slot
|
|
completes buy/collect/sell/collect, archives the first ledger, and
|
|
places a second buy in the same slot without loss, duplication, or
|
|
mutation of the archived record;
|
|
economy.ceiling_gp_per_hour is the TYPED economic ceiling and
|
|
0 <= gp_per_hour_low <= gp_per_hour_high <= ceiling.
|
|
- Woodcutting entries (woodcutting tag, owner 10288 + governor
|
|
10398): canonical F2P axe table + equip-vs-carry rule (41 WC to
|
|
USE / 40 Attack to EQUIP, a 1-Attack/41-WC account carries and
|
|
uses a rune axe), exactly three deterministic modes with
|
|
per-SELECTED-row rate derivation (27/28-slot capacity from
|
|
axe_equipped, committed woodcutting_fixtures recomputed by this
|
|
validator), drop-mode realized GP zero, and state-machine wiring
|
|
(executable prepare -> walk_to_trees, no axe -> failed, drop
|
|
transition gated to the afk-xp drop mode).
|
|
- Regression fixtures (--selftest): a fractional-tax flipping
|
|
entry must FAIL; an above-cap high-value flip with the
|
|
correctly capped-tax net must PASS; a non-margin entry carrying
|
|
only `ge` plus a non-flip tag must PASS; plus per-slot scheduler
|
|
dispatch, conservation, buy-limit and nesting fixtures, and the
|
|
woodcutting axe/mode/fixture/wiring fixtures.
|
|
3. Global id uniqueness across the whole codex tree.
|
|
|
|
Exit codes: 0 = clean (warnings ok), 1 = validation errors.
|
|
|
|
Usage: python3 tools/validate.py [--stale-days 30] [--selftest]
|
|
--selftest: run the GE floor-tax regression fixtures only (no tree scan)
|
|
"""
|
|
import datetime
|
|
import json
|
|
import math
|
|
import re
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
import jsonschema
|
|
import yaml
|
|
|
|
ROOT = Path(__file__).resolve().parent.parent
|
|
SCHEMA = json.loads((ROOT / "schemas" / "entry.schema.json").read_text())
|
|
CODEX = ROOT / "codex"
|
|
STALE_DAYS = 30
|
|
|
|
|
|
def load_entries():
|
|
out = []
|
|
for p in CODEX.rglob("*.yaml"):
|
|
if p.name.startswith("_"): # dataset files (e.g. _f2p-alch-catalog.yaml)
|
|
continue
|
|
out.append(p)
|
|
return sorted(out)
|
|
|
|
|
|
MARGIN_TAGS = {"flipping", "merchanting"}
|
|
|
|
|
|
def ge_floor_tax_error(rel, data):
|
|
"""GE floor-tax gate for a single entry.
|
|
|
|
Applies ONLY to the unambiguous margin tags (flipping/merchanting).
|
|
The generic `ge` tag is not proof that income_per_cycle is a taxed
|
|
GE resale: a training/processing/procurement entry may carry `ge`
|
|
while modeling unrelated income/cost, so it must not be gated by
|
|
this rule. Returns an error message, or None when the entry is not
|
|
gated or its floored-tax arithmetic is correct.
|
|
|
|
Wiki: "The 2% tax rounds down to the nearest whole number, so items
|
|
sold for below 50 coins have a tax of less than one coin" — per-item
|
|
net MUST use the floored tax, never 0.98*sell - buy. The fee is also
|
|
capped at 5,000,000 GP per item (per-item cap, documented in the
|
|
flip-candidates best_practice/risk), so tax = min(floor(0.02*sell),
|
|
5_000_000). Owner decision 2026-08-28: one global formula for all
|
|
entries (option A), no per-entry tax-model discriminator.
|
|
"""
|
|
tags = {str(t).lower() for t in data.get("tags", [])}
|
|
if not tags & MARGIN_TAGS:
|
|
return None
|
|
eco = data.get("economy") or {}
|
|
if not all(k in eco for k in ("income_per_cycle", "cost_per_cycle", "net_per_cycle")):
|
|
return None
|
|
sell, buy = eco["income_per_cycle"], eco["cost_per_cycle"]
|
|
tax = min(math.floor(sell * 0.02), 5_000_000)
|
|
expected = sell - tax - buy
|
|
if eco["net_per_cycle"] != expected:
|
|
return (
|
|
f"{rel}: net_per_cycle {eco['net_per_cycle']} != capped floored-tax "
|
|
f"model {expected} (sell {sell} - min(floor({sell}*0.02), 5_000_000)"
|
|
f"={tax} - buy {buy}); "
|
|
f"GE tax rounds down per item and is capped at 5,000,000 GP per item "
|
|
f"— fractional 0.98*sell - buy and uncapped tax are invalid")
|
|
return None
|
|
|
|
|
|
def alch_worked_example_regression(rel, data, raw_text):
|
|
"""One-cast model worked-example regression (owner guidance 2026-08-28,
|
|
PR #8 repair, merged via origin/main into issue-1): entries with the
|
|
owner-selected one-cast iteration model must pin a worked example with
|
|
MONOTONIC, INDEPENDENT counters — breaks every 550 casts (1,100, 1,650,
|
|
...) regardless of restocks, and restocks every 901 casts (1,802, ...),
|
|
so restocking never resets or shifts the break counter. Scoped to
|
|
entries that declare the one-cast model AND carry a worked example, so
|
|
unrelated entries are untouched.
|
|
"""
|
|
ruco = data.get("run_control") or {}
|
|
if "one cast" not in str(ruco.get("iteration", "")):
|
|
return []
|
|
if "worked example" not in raw_text.lower():
|
|
return []
|
|
errs = []
|
|
if "1,452" in raw_text:
|
|
errs.append(f"{rel}: worked example resets the break interval at a restock "
|
|
f"(cast 1,452 = 901 + restarted interval) — breaks must stay "
|
|
f"monotonic at 550/1,100/1,650 independently of restocks")
|
|
for marker, label in (("550", "break #1 (cast 550)"),
|
|
("901", "restock #1 (cast 901)"),
|
|
("1,100", "break #2 (cast 1,100)"),
|
|
("1,650", "break #3 (cast 1,650)"),
|
|
("1,802", "restock #2 (cast 1,802)")):
|
|
if marker not in raw_text:
|
|
errs.append(f"{rel}: worked example missing monotonic counter pin "
|
|
f"{label} — breaks/restocks must be pinned literally")
|
|
return errs
|
|
|
|
|
|
def _loss_reserve_stop(initial_capital, total_assets, reserve):
|
|
"""Loss-reserve stop comparator in the pinned direction (owner guidance
|
|
2026-08-29, governor review 10361, PR #8): stop fires only when the
|
|
loss EXCEEDS the reserve, i.e. when (initial capital - total assets)
|
|
> reserve. A loss makes the LHS positive; a profit (total assets >
|
|
initial capital) makes it negative and can never fire this stop. The
|
|
reversed 'total assets - initial capital' form is invalid because it
|
|
is negative exactly when a loss exists.
|
|
"""
|
|
return (initial_capital - total_assets) > reserve
|
|
|
|
|
|
def alch_accounting_regression(rel, data, raw_text):
|
|
"""Loss-reserve + fill-price accounting regression (owner guidance
|
|
2026-08-29 for governor review 10361, PR #8): the low-alch-members
|
|
entry must express the loss-reserve stop in the correct direction
|
|
EVERYWHERE ('initial capital - total assets > 162,990'), the reversed
|
|
sign form must never reappear, and the realized GP/hour bounds must be
|
|
derived from the declared fill-price scenarios (A live-low -3.00/cast
|
|
vs B max allowed +5% fill -30.15/cast), exposing the +5% fill loss
|
|
instead of recycling the live-low margin. Includes below/at/above
|
|
boundary fixtures and a profit-side negative regression for the
|
|
comparator itself. Scoped to the members low-alchemy entry only.
|
|
"""
|
|
if data.get("id") != "low-alch-members":
|
|
return []
|
|
errs = []
|
|
|
|
# 1. comparator boundary fixtures (pure function, entry's own constants)
|
|
INIT, RESERVE = 1_308_290, 162_990 # entry capital / 6-batch reserve
|
|
fixtures = [
|
|
("below (loss 162,989)", INIT - 162_989, False),
|
|
("at boundary (loss 162,990, strict >)", INIT - 162_990, False),
|
|
("above (loss 162,991)", INIT - 162_991, True),
|
|
("profit side (assets 50,000 above initial)", INIT + 50_000, False),
|
|
("breakeven (assets == initial)", INIT, False),
|
|
]
|
|
for label, total_assets, expect in fixtures:
|
|
got = _loss_reserve_stop(INIT, total_assets, RESERVE)
|
|
if got != expect:
|
|
errs.append(f"{rel}: loss-reserve comparator fixture '{label}' "
|
|
f"returned {got}, expected {expect}")
|
|
|
|
# 2. entry direction: correct form present, reversed form absent
|
|
if "initial capital - total assets > 162,990" not in raw_text:
|
|
errs.append(f"{rel}: loss-reserve stop must be expressed as "
|
|
f"'initial capital - total assets > 162,990' everywhere")
|
|
if "total assets - initial capital" in raw_text:
|
|
errs.append(f"{rel}: loss-reserve stop uses the reversed sign form — "
|
|
f"on a loss it is negative and can never exceed the "
|
|
f"reserve; use 'initial capital - total assets > 162,990'")
|
|
|
|
# 3. realized GP bounds must come from the fill-price scenarios
|
|
eco = data.get("economy", {})
|
|
if eco.get("gp_per_hour_low") != -29463:
|
|
errs.append(f"{rel}: gp_per_hour_low must be -29,463 (max-fill "
|
|
f"scenario B -30.15/cast x session-fast 977.2 casts/hr "
|
|
f"= -29,462.6), got {eco.get('gp_per_hour_low')}")
|
|
if eco.get("gp_per_hour_high") != -1758:
|
|
errs.append(f"{rel}: gp_per_hour_high must be -1,758 (live-low "
|
|
f"scenario A -3.00/cast x session-slow 585.9 casts/hr "
|
|
f"= -1,757.7), got {eco.get('gp_per_hour_high')}")
|
|
for pin, label in (("-30.15", "max-fill per-cast loss -30.15"),
|
|
("570.15", "max-fill per-cast cost 570.15"),
|
|
("423.15", "max-fill candidate price 423.15")):
|
|
if pin not in raw_text:
|
|
errs.append(f"{rel}: economy FILL-PRICE SCENARIOS missing {label} "
|
|
f"({pin}) — the +5% accepted-fill scenario must be "
|
|
f"declared so the realized GP bounds cannot silently "
|
|
f"revert to the live-low-only margin")
|
|
return errs
|
|
|
|
|
|
# --- GE-flip lifecycle gates (owner guidance 2026-08-28, governor 10323 + 10390) ---
|
|
# Canonical per-slot sub-states: each GE slot is an INDEPENDENT asynchronous
|
|
# machine driven by a global scheduler pass; a pass never closes or advances
|
|
# a slot it did not touch. A COMPLETED offer leaves its assets in the GE
|
|
# collection box until ge_collect: fully filled buys and sells each get an
|
|
# explicit *-filled-awaiting-collect state (governor 10390 finding 2).
|
|
SLOT_SUB_STATES = [
|
|
"free", # no offer, nothing held
|
|
"buy-open", # resting buy offer (partial fills keep resting)
|
|
"buy-filled-awaiting-collect", # buy FULLY filled — units sit in the GE collection box until ge_collect
|
|
"buy-cancelled-awaiting-collect", # aborted buy: bought units + refunded CASH in the box
|
|
"ready-to-sell", # units in hand (ge_collect'ed), sell edge positive
|
|
"sell-open", # resting sell offer (partial sells tracked)
|
|
"sell-filled-awaiting-collect", # sell FULLY filled — proceeds sit in the box until ge_collect
|
|
"sell-cancelled-awaiting-collect", # aborted sell: proceeds + unsold units in the box
|
|
"ready-to-requote", # collected units/refunds; requote or abandon
|
|
"closed", # completed cycle: ledger reconciled + ARCHIVED; the physical slot is released to free via the closed -> free archival transition (governor 10471)
|
|
]
|
|
# Dispatch table: the pure action a slot in a given sub-state needs this pass.
|
|
SLOT_DISPATCH = {
|
|
"free": "quote",
|
|
"buy-open": None, # resting; fill/abort decided by policies
|
|
"buy-filled-awaiting-collect": "collect",
|
|
"buy-cancelled-awaiting-collect": "collect",
|
|
"ready-to-sell": "sell",
|
|
"sell-open": None, # resting; fill/abort decided by policies
|
|
"sell-filled-awaiting-collect": "collect",
|
|
"sell-cancelled-awaiting-collect": "collect",
|
|
"ready-to-requote": "requote",
|
|
"closed": "release", # archival release: closed -> free (governor 10471)
|
|
}
|
|
|
|
|
|
def scheduler_dispatch(sub_state):
|
|
"""The pending action for one slot in one scheduler pass, or None.
|
|
|
|
A None (resting) slot is left completely untouched — the pass must not
|
|
close, advance, or mutate it. This is the property the worked-example
|
|
regression proves. A 'closed' slot is NOT resting: its completed
|
|
cycle's ledger was archived at ge_collect time and the pass releases
|
|
the physical slot to free ('release' = the closed -> free archival
|
|
transition), so the slot can run another flip instead of stranding
|
|
forever (governor 10471). Resting states are buy-open / sell-open
|
|
only.
|
|
"""
|
|
return SLOT_DISPATCH.get(sub_state)
|
|
|
|
|
|
# Side-aware GE bucket names (governor 10390 finding 4).
|
|
# BUY: the player commits CASH; acquired items are `filled` ONLY — the
|
|
# unfilled/cancelled quantity is an unspent-CASH refund, never "refunded
|
|
# units". SELL: the player holds units; sold units yield proceeds.
|
|
BUY_UNIT_BUCKETS = ["filled", "still_open", "cancelled_unfilled"]
|
|
SELL_UNIT_BUCKETS = ["sold", "still_open", "returned_unsold"]
|
|
# Physically impossible co-occurrences per side (cancel is atomic: a live
|
|
# offer has no remainder once cancelled).
|
|
IMPOSSIBLE_UNIT_PAIRS = {
|
|
"buy": [("still_open", "cancelled_unfilled")],
|
|
"sell": [("still_open", "returned_unsold")],
|
|
}
|
|
|
|
|
|
def conservation_violations(record):
|
|
"""Side-aware per-slot GE conservation (governor 10390 finding 4).
|
|
|
|
record: {
|
|
'side': 'buy'|'sell', # REQUIRED — the ledger is
|
|
'quoted': {item: qty}, # side-aware
|
|
**unit buckets (side-specific): # {item: qty}
|
|
'cash_quoted': int, # BUY: cash committed
|
|
'spent'/'still_committed'/'refunded': int, # BUY cash partition
|
|
'proceeds_in_box'/'cash_collected': int, # SELL proceeds
|
|
'sub_state': str, # phase gate input
|
|
}
|
|
|
|
BUY invariants:
|
|
- unit partition: quoted == filled + still_open + cancelled_unfilled
|
|
per item;
|
|
- ACQUIRED ITEMS == filled ONLY: any sell-side unit bucket (sold /
|
|
returned_unsold) or a 'refunded' unit bucket on a buy record is a
|
|
violation — the unfilled/cancelled quantity is CASH (phantom
|
|
"refunded units" guard);
|
|
- cash partition: cash_quoted == spent + still_committed + refunded
|
|
(the unspent remainder of a buy is the cash refund);
|
|
- no item may be both still_open and cancelled_unfilled (cancel is
|
|
atomic).
|
|
SELL invariants:
|
|
- unit partition: quoted == sold + still_open + returned_unsold per
|
|
item;
|
|
- no item may be both still_open and returned_unsold (cancel is
|
|
atomic); sold + still_open IS legal (partial sell rest).
|
|
Shared: no negative quantities.
|
|
"""
|
|
out = []
|
|
side = record.get("side", "buy")
|
|
if side not in ("buy", "sell"):
|
|
out.append(f"record side {side!r} must be 'buy' or 'sell'")
|
|
return out
|
|
buckets = BUY_UNIT_BUCKETS if side == "buy" else SELL_UNIT_BUCKETS
|
|
foreign = {"filled", "still_open", "cancelled_unfilled", "sold",
|
|
"returned_unsold"} - set(buckets)
|
|
for b in sorted(foreign):
|
|
if record.get(b):
|
|
out.append(
|
|
f"{side} ledger uses {b} units — invalid for side {side}: "
|
|
f"buy-side unfilled/cancelled quantity is CASH "
|
|
f"(refunded), never {b} units; sell-side units partition "
|
|
f"into sold/still_open/returned_unsold")
|
|
if side == "buy":
|
|
# A unit map under a CASH field is the phantom-items guard: a buy's
|
|
# unfilled/cancelled quantity is an unspent-CASH refund, never
|
|
# "refunded units" (governor 10390 finding 4).
|
|
for c in ("cash_quoted", "spent", "still_committed", "refunded"):
|
|
if isinstance(record.get(c), dict):
|
|
out.append(
|
|
f"buy ledger carries {c} as units — the unfilled/"
|
|
f"cancelled quantity of a buy is CASH (refunded), "
|
|
f"never {c} units (phantom items)")
|
|
for b in buckets:
|
|
for item in record.get(b, {}):
|
|
q = record[b][item]
|
|
if q < 0:
|
|
out.append(f"item '{item}' bucket {b} is negative ({q})")
|
|
quoted = record.get("quoted", {})
|
|
for item, qq in quoted.items():
|
|
if qq < 0:
|
|
out.append(f"item '{item}' quoted is negative ({qq})")
|
|
total = sum(record.get(b, {}).get(item, 0) for b in buckets)
|
|
if total != qq:
|
|
out.append(
|
|
f"item '{item}' quoted {qq} != "
|
|
f"{' + '.join(buckets)} ({total})")
|
|
in_b = {b for b in buckets if item in record.get(b, {})}
|
|
for a, b in IMPOSSIBLE_UNIT_PAIRS[side]:
|
|
if (a in in_b and b in in_b
|
|
and record.get(a, {}).get(item)
|
|
and record.get(b, {}).get(item)):
|
|
out.append(
|
|
f"item '{item}' appears in both {a} and {b} — "
|
|
f"physically impossible (a cancelled offer has no "
|
|
f"live remainder)")
|
|
if side == "buy":
|
|
cash_fields = ["cash_quoted", "spent", "still_committed", "refunded"]
|
|
for c in cash_fields:
|
|
if isinstance(record.get(c), (int, float)) and record[c] < 0:
|
|
out.append(f"{c} is negative ({record[c]})")
|
|
cash_vals = {c: record.get(c) for c in cash_fields}
|
|
if all(isinstance(v, (int, float)) for v in cash_vals.values()):
|
|
if cash_vals["cash_quoted"] != (
|
|
cash_vals["spent"] + cash_vals["still_committed"]
|
|
+ cash_vals["refunded"]):
|
|
out.append(
|
|
f"buy cash quoted {cash_vals['cash_quoted']} != spent "
|
|
f"{cash_vals['spent']} + still_committed "
|
|
f"{cash_vals['still_committed']} + refunded "
|
|
f"{cash_vals['refunded']} — the unspent remainder of a "
|
|
f"buy is the CASH refund")
|
|
else:
|
|
for c in ("proceeds_in_box", "cash_collected"):
|
|
if record.get(c, 0) < 0:
|
|
out.append(f"{c} is negative ({record[c]})")
|
|
return out
|
|
|
|
|
|
def slot_phase_violations(record):
|
|
"""Phase gates (governor 10390 finding 4): assets may not be reused or
|
|
a slot closed before the GE collection box is withdrawn.
|
|
|
|
- 'buy-filled-awaiting-collect': filled must equal quoted (fully
|
|
filled) and NOTHING may have been sold yet — a full buy that sells
|
|
before ge_collect is a violation (owned units cannot leave the
|
|
collection box early).
|
|
- 'sell-filled-awaiting-collect': sold units require proceeds_in_box
|
|
> 0 — proceeds arrive in the box as units fill and only leave via
|
|
ge_collect.
|
|
- 'closed': nothing may remain uncollected — proceeds_in_box must be
|
|
0 and no cancelled/returned units may still be in the box (a full
|
|
sell may not close before proceeds collection).
|
|
"""
|
|
out = []
|
|
sub = record.get("sub_state")
|
|
side = record.get("side", "buy")
|
|
sold = sum((record.get("sold") or {}).values())
|
|
filled = sum((record.get("filled") or {}).values())
|
|
quoted = sum((record.get("quoted") or {}).values())
|
|
if side == "buy" and sub == "buy-filled-awaiting-collect":
|
|
if sold:
|
|
out.append(
|
|
"buy-filled-awaiting-collect slot has sold units — a full "
|
|
"buy cannot sell before ge_collect")
|
|
if filled != quoted:
|
|
out.append(
|
|
f"buy-filled-awaiting-collect slot is not fully filled "
|
|
f"(filled {filled} != quoted {quoted})")
|
|
if sub == "sell-filled-awaiting-collect" and sold and not record.get("proceeds_in_box"):
|
|
out.append(
|
|
"sell-filled-awaiting-collect slot has sold units but no "
|
|
"proceeds_in_box — proceeds arrive in the collection box on "
|
|
"fill and leave only via ge_collect")
|
|
if sub == "closed":
|
|
if record.get("proceeds_in_box"):
|
|
out.append(
|
|
"closed slot still has proceeds_in_box — a full sell may "
|
|
"not close before proceeds collection (ge_collect first)")
|
|
cancelled = sum((record.get("cancelled_unfilled") or {}).values())
|
|
returned = sum((record.get("returned_unsold") or {}).values())
|
|
if cancelled or returned:
|
|
out.append(
|
|
"closed slot still holds cancelled/returned units — "
|
|
"collect them before closing the slot")
|
|
return out
|
|
|
|
|
|
def buy_capacity_ok(limit_used, limit, qty_requested):
|
|
"""The 4h buy-limit ledger (governor 10323 finding 1): the limit resets
|
|
4h after the FIRST unit was bought; cancelling an offer does NOT renew
|
|
it, so a requote before the reset cannot buy beyond the remaining
|
|
capacity. Returns True when limit_used + qty_requested <= limit.
|
|
"""
|
|
return limit_used + qty_requested <= limit
|
|
|
|
|
|
# Deterministic ledger frames for ONE physical GE slot across TWO full
|
|
# flips (governor 10471): the fixture walks a complete buy/collect/
|
|
# sell/collect cycle, archives the first ledger at `closed`, releases the
|
|
# physical slot to `free`, and opens a SECOND buy in the SAME slot. Every
|
|
# frame must satisfy both conservation checks; the archived first-cycle
|
|
# record must survive rotation 2 untouched (no loss, duplication, or
|
|
# mutation). Prices: Rune arrowtips buy 223 / sell 244 / tax
|
|
# min(floor(244*0.02), 5M) = 4 / proceeds 2,440,000 (snapshot 2026-08-27,
|
|
# matches the worked example).
|
|
_CYCLE_ITEM = "Rune arrowtips"
|
|
|
|
_CYCLE_FRAMES = [
|
|
# (sub_state, ledger) — ledger is side-aware and conservation-clean.
|
|
("free", {"side": "buy", "quoted": {}, "filled": {}, "still_open": {},
|
|
"cancelled_unfilled": {}, "cash_quoted": 0, "spent": 0,
|
|
"still_committed": 0, "refunded": 0}),
|
|
("buy-open", {"side": "buy", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"filled": {}, "still_open": {_CYCLE_ITEM: 10_000},
|
|
"cancelled_unfilled": {}, "cash_quoted": 2_230_000,
|
|
"spent": 0, "still_committed": 2_230_000, "refunded": 0}),
|
|
("buy-filled-awaiting-collect",
|
|
{"side": "buy", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"filled": {_CYCLE_ITEM: 10_000}, "still_open": {},
|
|
"cancelled_unfilled": {}, "cash_quoted": 2_230_000,
|
|
"spent": 2_230_000, "still_committed": 0, "refunded": 0}),
|
|
("ready-to-sell",
|
|
{"side": "buy", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"filled": {_CYCLE_ITEM: 10_000}, "still_open": {},
|
|
"cancelled_unfilled": {}, "cash_quoted": 2_230_000,
|
|
"spent": 2_230_000, "still_committed": 0, "refunded": 0}),
|
|
("sell-open", {"side": "sell", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"sold": {}, "still_open": {_CYCLE_ITEM: 10_000},
|
|
"returned_unsold": {}, "proceeds_in_box": 0,
|
|
"cash_collected": 0}),
|
|
("sell-filled-awaiting-collect",
|
|
{"side": "sell", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"sold": {_CYCLE_ITEM: 10_000}, "still_open": {},
|
|
"returned_unsold": {}, "proceeds_in_box": 2_440_000,
|
|
"cash_collected": 0}),
|
|
("closed", {"side": "sell", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"sold": {_CYCLE_ITEM: 10_000}, "still_open": {},
|
|
"returned_unsold": {}, "proceeds_in_box": 0,
|
|
"cash_collected": 2_440_000}), # ARCHIVED here
|
|
("free", {"side": "buy", "quoted": {}, "filled": {}, "still_open": {},
|
|
"cancelled_unfilled": {}, "cash_quoted": 0, "spent": 0,
|
|
"still_committed": 0, "refunded": 0}), # released: physical slot reusable
|
|
# rotation 2: the SAME physical slot opens a second buy (ledger reset;
|
|
# the archived rotation-1 record above must remain untouched).
|
|
("buy-open", {"side": "buy", "quoted": {_CYCLE_ITEM: 10_000},
|
|
"filled": {}, "still_open": {_CYCLE_ITEM: 10_000},
|
|
"cancelled_unfilled": {}, "cash_quoted": 2_230_000,
|
|
"spent": 0, "still_committed": 2_230_000, "refunded": 0}),
|
|
]
|
|
|
|
# The canonical complete flip cycle: rotation 1 (buy/collect/sell/collect)
|
|
# plus the archival release and the start of rotation 2.
|
|
_CYCLE_PATH = [f[0] for f in _CYCLE_FRAMES]
|
|
|
|
# Index of the `closed` frame (archived ledger) and the frames around it.
|
|
_CLOSED_IDX = _CYCLE_PATH.index("closed")
|
|
|
|
|
|
def slot_reuse_violations(transitions):
|
|
"""Two-rotation slot-reuse regression (governor 10471).
|
|
|
|
Walks ``_CYCLE_PATH`` through the entry's ``slot_transitions`` and
|
|
validates every ledger frame against both conservation gates. A
|
|
``closed`` state with no outgoing transition (or one that does not
|
|
release to ``free``) strands the physical GE slot after one flip —
|
|
the exact defect this regression exists to forbid. Errors are
|
|
returned as a list of strings.
|
|
"""
|
|
out = []
|
|
for a, b in zip(_CYCLE_PATH, _CYCLE_PATH[1:]):
|
|
if b not in (transitions.get(a) or []):
|
|
out.append(
|
|
f"slot cycle: transition {a} -> {b} is missing — a completed "
|
|
f"flip must end by releasing the physical slot to free "
|
|
f"(archival release closed -> free), otherwise the slot "
|
|
f"performs one flip and then becomes permanently unusable")
|
|
for state, record in _CYCLE_FRAMES:
|
|
rec = dict(record, sub_state=state)
|
|
con = conservation_violations(rec)
|
|
if con:
|
|
out.append(f"slot cycle: conservation fails at '{state}': {con}")
|
|
ph = slot_phase_violations(rec)
|
|
if ph:
|
|
out.append(f"slot cycle: phase gate fails at '{state}': {ph}")
|
|
return out
|
|
|
|
|
|
def archived_ledger_preserved_after_second_buy():
|
|
"""The rotation-1 archived ledger survives rotation 2 intact.
|
|
|
|
``closed`` archives a deep copy of the completed cycle's ledger; when
|
|
the same physical slot is released to free and opens a second buy, the
|
|
archived record must be bit-for-bit unchanged (no loss, duplication,
|
|
or mutation) while the live ledger is a fresh empty record.
|
|
"""
|
|
archived = json.loads(json.dumps(_CYCLE_FRAMES[_CLOSED_IDX][1]))
|
|
archived_state = _CYCLE_FRAMES[_CLOSED_IDX][0]
|
|
live = {k: (dict(v) if isinstance(v, dict) else v)
|
|
for k, v in _CYCLE_FRAMES[-1][1].items()} # rotation-2 buy-open ledger
|
|
if archived != _CYCLE_FRAMES[_CLOSED_IDX][1]:
|
|
return ["slot cycle: archived rotation-1 ledger was MUTATED by rotation 2"]
|
|
if archived_state != "closed":
|
|
return [f"slot cycle: unexpected archived state {archived_state!r}"]
|
|
# The live ledger at rotation-2 buy-open must be a fresh record, not a
|
|
# copy of the archived one: quoted cash/units belong to rotation 2.
|
|
if live.get("cash_quoted") != 2_230_000 or live.get("proceeds_in_box"):
|
|
return ["slot cycle: rotation-2 live ledger is not a fresh record"]
|
|
return []
|
|
|
|
|
|
def ge_lifecycle_errors(rel, data):
|
|
"""GE-flip lifecycle gates (flipping/merchanting entries only):
|
|
|
|
- the 4h buy-limit ledger is distinct from offer expiry: the entry must
|
|
declare a limit_ledger + an independent quote_age_policy;
|
|
- the slot model is per-slot asynchronous: slot_state_machine must
|
|
declare exactly the canonical sub-states, valid transitions, a
|
|
scheduler_iteration, persisted_state, conservation and break_resume;
|
|
'closed' is NOT a sink: it must release the physical slot via the
|
|
archival transition closed -> free, and the committed two-rotation
|
|
reuse regression (slot_reuse_violations) must pass;
|
|
- rates: ceiling_gp_per_hour is the typed economic ceiling and
|
|
0 <= gp_per_hour_low <= gp_per_hour_high <= ceiling.
|
|
"""
|
|
errors = []
|
|
tags = {str(t).lower() for t in data.get("tags", [])}
|
|
if not tags & MARGIN_TAGS:
|
|
return errors
|
|
eco = data.get("economy") or {}
|
|
# --- typed ceiling vs realized bounds ---
|
|
ceil = eco.get("ceiling_gp_per_hour")
|
|
if not isinstance(ceil, (int, float)) or ceil <= 0:
|
|
errors.append(f"{rel}: flipping entries must declare "
|
|
f"economy.ceiling_gp_per_hour (the typed 4h buy-limit "
|
|
f"economic ceiling, distinct from realized rates)")
|
|
return errors
|
|
low, high = eco.get("gp_per_hour_low"), eco.get("gp_per_hour_high")
|
|
for name, val in (("gp_per_hour_low", low), ("gp_per_hour_high", high)):
|
|
if not isinstance(val, (int, float)) or val < 0:
|
|
errors.append(f"{rel}: {name} must be a non-negative realized "
|
|
f"scenario bound")
|
|
if isinstance(low, (int, float)) and isinstance(high, (int, float)) \
|
|
and isinstance(ceil, (int, float)):
|
|
if not (low <= high <= ceil):
|
|
errors.append(
|
|
f"{rel}: realized bounds must nest under the ceiling: "
|
|
f"0 <= gp_per_hour_low {low} <= gp_per_hour_high {high} "
|
|
f"<= ceiling_gp_per_hour {ceil}")
|
|
# --- per-slot asynchronous model ---
|
|
ssm = data.get("slot_state_machine") or {}
|
|
if not isinstance(ssm, dict):
|
|
errors.append(f"{rel}: flipping entries must declare a "
|
|
f"slot_state_machine block (per-slot asynchronous sub-states)")
|
|
return errors
|
|
declared = [str(s) for s in ssm.get("sub_states", [])]
|
|
if sorted(declared) != sorted(SLOT_SUB_STATES):
|
|
errors.append(
|
|
f"{rel}: slot_state_machine.sub_states must be exactly the canonical "
|
|
f"set: {', '.join(SLOT_SUB_STATES)} (got: {', '.join(declared) or 'none'})")
|
|
trans = ssm.get("slot_transitions") or {}
|
|
if not isinstance(trans, dict):
|
|
errors.append(f"{rel}: slot_state_machine.slot_transitions must be a mapping")
|
|
trans = {}
|
|
for from_s, tos in trans.items():
|
|
if from_s not in SLOT_SUB_STATES:
|
|
errors.append(f"{rel}: slot transition from unknown sub-state '{from_s}'")
|
|
for to_s in tos if isinstance(tos, list) else []:
|
|
if to_s not in SLOT_SUB_STATES:
|
|
errors.append(f"{rel}: slot transition '{from_s}' -> unknown "
|
|
f"sub-state '{to_s}'")
|
|
for state in SLOT_SUB_STATES:
|
|
if not trans.get(state):
|
|
errors.append(f"{rel}: slot sub-state '{state}' has no transitions "
|
|
f"— every state must be able to advance; a closed "
|
|
f"slot must release the physical slot via the "
|
|
f"archival closed -> free transition (governor 10471)")
|
|
if list(trans.get("closed") or []) != ["free"]:
|
|
errors.append(f"{rel}: 'closed' must have exactly the archival release "
|
|
f"['free'] — a closed slot with no outgoing transition "
|
|
f"performs one flip and then becomes permanently "
|
|
f"unusable (governor 10471)")
|
|
whens = [str(w) for w in ssm.get("slot_transition_whens", []) or []]
|
|
for w in whens:
|
|
arrow = w.split("->")
|
|
if len(arrow) != 2 or arrow[0].strip() not in SLOT_SUB_STATES \
|
|
or arrow[1].strip().split(":")[0].strip() not in SLOT_SUB_STATES:
|
|
errors.append(f"{rel}: slot_transition_whens entry '{w}' must be "
|
|
f"'from -> to: condition' with canonical sub-states")
|
|
for field in ("scheduler_iteration", "quote_age_policy", "persisted_state",
|
|
"limit_ledger", "conservation", "break_resume"):
|
|
if not str(ssm.get(field, "")).strip():
|
|
errors.append(f"{rel}: slot_state_machine.{field} must be declared")
|
|
# Two-rotation reuse regression (governor 10471): every flipping entry's
|
|
# encoded machine must complete buy/collect/sell/collect, release the
|
|
# physical slot to free, and support a second buy in the same slot.
|
|
errors += [f"{rel}: {e}" for e in slot_reuse_violations(trans)]
|
|
return errors
|
|
|
|
|
|
# --- Woodcutting structured gates (owner 10288 + governor 10398 shape) ---
|
|
# Canonical F2P axe table (OSRS wiki, verified 2026-08-28): the Woodcutting
|
|
# level is the TOOL-USE requirement (chopping), the Attack level is the
|
|
# EQUIP requirement. An account uses the highest axe whose Woodcutting level
|
|
# it meets, and equips it only when its Attack level is also met — otherwise
|
|
# it CARRIES that same axe (costing one inventory slot). Order is the tier
|
|
# tiebreak (iron beats bronze at equal requirements; gilded ~ rune).
|
|
AXE_TIERS = [
|
|
# (axe, woodcutting_level_to_use, attack_level_to_equip, members_only)
|
|
("bronze", 1, 1, False),
|
|
("iron", 1, 1, False),
|
|
("steel", 6, 5, False),
|
|
("black", 11, 10, False),
|
|
("mithril", 21, 20, False),
|
|
("adamant", 31, 30, False),
|
|
("rune", 41, 40, False),
|
|
("gilded", 41, 40, False),
|
|
("dragon", 61, 60, True),
|
|
]
|
|
AXE_NAMES = {row[0] for row in AXE_TIERS}
|
|
TIER_RANK = {"bronze": 0, "iron": 1, "steel": 2, "black": 3, "mithril": 4,
|
|
"adamant": 5, "rune": 6, "gilded": 6, "dragon": 7}
|
|
XP_PER_LOG = {"tree": 25, "oak": 37.5, "willow": 67.5, "maple": 100, "yew": 175}
|
|
TREE_MIN_LEVEL = {"tree": 1, "oak": 15, "willow": 30, "maple": 45, "yew": 60}
|
|
|
|
|
|
def best_axe(wc_level, attack_level):
|
|
"""Deterministic axe selection (owner guidance 2026-08-28 / governor 10323):
|
|
pick the highest tier usable at wc_level (tool-use requirement); equip it
|
|
only when attack_level meets that tier's equip requirement, else carry it.
|
|
Returns (axe, equipped_bool). Ties at the same Woodcutting requirement are
|
|
broken by TIER_RANK (iron beats bronze; rune beats the cosmetic gilded)."""
|
|
usable = [row for row in AXE_TIERS if row[3] is False and wc_level >= row[1]]
|
|
if not usable:
|
|
return None, False
|
|
best = max(usable, key=lambda row: (row[1], TIER_RANK[row[0]]))
|
|
return best[0], attack_level >= best[2]
|
|
|
|
|
|
def select_ladder_row(ladder, wc_level, quest_gate, combat_level):
|
|
"""Deterministic first match over a mode ladder (rows ordered min_level
|
|
DESC per the schema contract): the first row whose min_level the account
|
|
meets AND whose gate is satisfied.
|
|
|
|
Gates: none -> always; combat-15-plus -> combat_level >= 15;
|
|
combat-under-15 -> combat_level < 15 (below the Draynor dark-wizard
|
|
threshold); dragon-slayer-i -> quest_gate (Corsair Cove Resource Area).
|
|
Returns the matched row dict or None."""
|
|
for r in ladder:
|
|
if wc_level < int(r.get("min_level", 0)):
|
|
continue
|
|
gate = r.get("gate", "none")
|
|
if gate == "combat-15-plus" and not (combat_level >= 15):
|
|
continue
|
|
if gate == "combat-under-15" and not (combat_level < 15):
|
|
continue
|
|
if gate == "dragon-slayer-i" and not quest_gate:
|
|
continue
|
|
return r
|
|
return None
|
|
|
|
|
|
def row_rates(row, model, policy, capacity):
|
|
"""Per-SELECTED-ROW realized rate derivation (governor 10398 finding 4):
|
|
the account's ladder row carries its own chop cadence / bank-walk /
|
|
respawn duty / log price, so rates derive from the row actually chosen
|
|
(and the actual 27/28 capacity from axe_equipped) — never from a fixed
|
|
top tree or a hardcoded 28-log cycle.
|
|
|
|
Returns (logs_per_hour, xp_per_hour, gp_per_hour) with gp_per_hour = 0
|
|
for drop modes (realized GP; log value is reference-only)."""
|
|
chop = float(row.get("chop_seconds_per_log", 0))
|
|
walk = float(row.get("walk_seconds_each_way", 0))
|
|
respawn = float(row.get("respawn_duty", 0))
|
|
price = float(row.get("log_price", 0))
|
|
drop = float(model.get("drop_seconds_per_log") or 0)
|
|
deposit = float(model.get("deposit_seconds") or 0)
|
|
brk = float(model.get("break_duty") or 0)
|
|
tree = row.get("tree")
|
|
if tree not in XP_PER_LOG or chop <= 0 or respawn <= 0 or brk <= 0:
|
|
return None
|
|
if policy == "drop":
|
|
cycle = capacity * (chop + drop) + deposit # no bank legs
|
|
else:
|
|
cycle = capacity * chop + 2 * walk + deposit
|
|
if cycle <= 0:
|
|
return None
|
|
logs = (capacity / cycle) * 3600.0 * respawn * brk
|
|
xp = logs * XP_PER_LOG[tree]
|
|
gp = 0.0 if policy == "drop" else logs * price
|
|
return logs, xp, gp
|
|
|
|
|
|
def woodcutting_errors(rel, data):
|
|
"""Structured gates for woodcutting entries (owner guidance 10288 +
|
|
governor 10398; no phrase-search, exact computed checks):
|
|
|
|
- axe_tiers must match the canonical table exactly;
|
|
- axe_examples are recomputed and must match (incl. the 1-Attack /
|
|
41-Woodcutting rune-axe carry case);
|
|
- woodcutting_modes must be exactly [fast-xp, afk-xp, banked-income],
|
|
each ladder deterministic (rows ordered by min_level desc, first
|
|
match), with canonical per-tree level/gate constraints;
|
|
- mode `rates` is the canonical TOP-ROW reference (ladder[0], axe
|
|
equipped = 28 slots) and must equal that row's model chain within
|
|
tolerance, with xp/gp derived from the row's tree xp and log price;
|
|
- every LADDER ROW carries its own chop/walk/respawn/log_price and the
|
|
committed per-account woodcutting_fixtures rows must match the
|
|
selected-row derivation (27/28 capacity from axe_equipped) within
|
|
tolerance — governor 10398 finding 4;
|
|
- drop-policy modes realize ZERO gp (log value is a reference field,
|
|
never realized income) — governor 10398 finding 5;
|
|
- the state machine wires axe preparation BEFORE travel (a `prepare`
|
|
state with a bounded GE-buy chain leading to walk_to_trees), routes
|
|
an unobtainable axe to `failed` (never `complete`), and gates the
|
|
inventory-full drop transition to the drop policy mode only —
|
|
governor 10398 findings 1-3.
|
|
"""
|
|
errors = []
|
|
tags = {str(t).lower() for t in data.get("tags", [])}
|
|
if "woodcutting" not in tags:
|
|
return errors
|
|
|
|
# --- canonical axe table ---
|
|
tiers = data.get("axe_tiers") or []
|
|
canon = {(row[0], row[1], row[2], bool(row[3])) for row in AXE_TIERS}
|
|
declared = {(str(t.get("axe")), t.get("woodcutting_level"), t.get("attack_level"),
|
|
bool(t.get("members"))) for t in tiers}
|
|
if declared != canon:
|
|
errors.append(
|
|
f"{rel}: axe_tiers must match the canonical F2P table exactly "
|
|
f"(bronze 1/1, iron 1/1, steel 6/5, black 11/10, mithril 21/20, "
|
|
f"adamant 31/30, rune 41/40, gilded 41/40, dragon 61/60 members); "
|
|
f"got {sorted(declared)}")
|
|
return errors
|
|
|
|
# --- recompute the committed axe examples ---
|
|
for ex in data.get("axe_examples") or []:
|
|
name = ex.get("account", "?")
|
|
wc, atk = ex.get("woodcutting_level"), ex.get("attack_level")
|
|
axe, eq = best_axe(wc, atk)
|
|
if axe != ex.get("expected_axe") or eq != ex.get("expected_equipped"):
|
|
errors.append(
|
|
f"{rel}: axe_examples '{name}' (WC {wc}, Attack {atk}) — "
|
|
f"recomputed {axe}/equipped={eq}, entry declares "
|
|
f"{ex.get('expected_axe')}/equipped={ex.get('expected_equipped')}")
|
|
|
|
# --- modes ---
|
|
modes = data.get("woodcutting_modes") or []
|
|
if sorted(str(m.get("mode")) for m in modes) != ["afk-xp", "banked-income", "fast-xp"]:
|
|
errors.append(f"{rel}: woodcutting_modes must declare exactly "
|
|
f"fast-xp, afk-xp and banked-income")
|
|
return errors
|
|
for m in modes:
|
|
mode = m["mode"]
|
|
ladder = m.get("ladder") or []
|
|
if not ladder:
|
|
errors.append(f"{rel}: {mode} ladder is empty")
|
|
continue
|
|
levels = [int(r["min_level"]) for r in ladder]
|
|
if levels != sorted(levels, reverse=True):
|
|
errors.append(f"{rel}: {mode} ladder must be ordered by "
|
|
f"min_level DESC (deterministic first-match); got {levels}")
|
|
if any(re.search(r"\bor\b", str(r.get("spot", "")).lower())
|
|
or re.search(r"\bor\b", str(r.get("bank", "")).lower())
|
|
for r in ladder):
|
|
errors.append(f"{rel}: {mode} ladder rows must be unambiguous "
|
|
f"(no 'or' inside spot/bank fields)")
|
|
for r in ladder:
|
|
tree, min_level, gate = r["tree"], int(r["min_level"]), r.get("gate")
|
|
if min_level != TREE_MIN_LEVEL.get(tree):
|
|
errors.append(f"{rel}: {mode} {tree} must have min_level "
|
|
f"{TREE_MIN_LEVEL.get(tree)} (got {min_level})")
|
|
if tree == "maple" and gate != "dragon-slayer-i":
|
|
errors.append(f"{rel}: {mode} maple requires gate "
|
|
f"dragon-slayer-i (Corsair Cove Resource Area)")
|
|
if tree != "maple" and gate == "dragon-slayer-i":
|
|
errors.append(f"{rel}: {mode} gate dragon-slayer-i may only "
|
|
f"apply to the maple row (got {tree})")
|
|
# governor 10398 finding 4: every row must carry its own rate
|
|
# constants — rates derive from the SELECTED row, never from a
|
|
# fixed top-tree model.
|
|
for field in ("chop_seconds_per_log", "walk_seconds_each_way",
|
|
"respawn_duty", "log_price"):
|
|
if not isinstance(r.get(field), (int, float)):
|
|
errors.append(f"{rel}: {mode} {tree} row must carry "
|
|
f"numeric {field} (per-selected-row rates, "
|
|
f"governor 10398 finding 4)")
|
|
if mode == "fast-xp" and not any(r["tree"] == "willow" and int(r["min_level"]) == 30
|
|
for r in ladder):
|
|
errors.append(f"{rel}: fast-xp must include a willow row at "
|
|
f"min_level 30 (willow is the intended fast-XP target)")
|
|
if mode == "banked-income" and not any(r["tree"] == "yew" for r in ladder):
|
|
errors.append(f"{rel}: banked-income must include a yew row "
|
|
f"(yew from 60 when eligible)")
|
|
if mode == "afk-xp" and not any(r["tree"] == "maple" for r in ladder):
|
|
errors.append(f"{rel}: afk-xp must include a maple row (quest-gated "
|
|
f"AFK target); include quest-gated maple only when "
|
|
f"access is satisfied — with lower fallbacks below")
|
|
if not any(int(r["min_level"]) == 1 for r in ladder):
|
|
errors.append(f"{rel}: {mode} ladder must bottom out at a level-1 "
|
|
f"fallback (tree) — deterministic lower-level fallback")
|
|
|
|
# --- canonical TOP-ROW `rates` reference (ladder[0], 28 slots equipped) ---
|
|
model = m.get("model") or {}
|
|
policy = m.get("inventory_policy")
|
|
top = row_rates(ladder[0], model, policy, 28)
|
|
if top is None:
|
|
errors.append(f"{rel}: {mode} top-row rate chain does not compute "
|
|
f"(row constants/model numeric, cycle positive)")
|
|
continue
|
|
t_logs, t_xp, t_gp = top
|
|
rates = m.get("rates") or {}
|
|
logs = rates.get("logs_per_hour")
|
|
if not isinstance(logs, (int, float)) or abs(logs - t_logs) / t_logs > 0.01:
|
|
errors.append(
|
|
f"{rel}: {mode} logs_per_hour {logs} must equal the SELECTED-row "
|
|
f"chain (top row {ladder[0]['tree']}, 28 slots equipped: "
|
|
f"{t_logs:.1f}) within 1% — rates are per-selected-row, never "
|
|
f"a fixed 28-log top-tree hardcode (governor 10398 finding 4)")
|
|
if abs(rates.get("xp_per_hour", -1) - t_xp) / t_xp > 0.02:
|
|
errors.append(f"{rel}: {mode} xp_per_hour {rates.get('xp_per_hour')} "
|
|
f"must equal the row chain xp {t_xp:.0f} "
|
|
f"(logs x {XP_PER_LOG[ladder[0]['tree']]}) within 2%")
|
|
if policy == "drop":
|
|
# governor 10398 finding 5: dropped logs realize ZERO gp; the log
|
|
# sell price is reference/opportunity cost only.
|
|
if rates.get("gp_per_hour", -1) != 0:
|
|
errors.append(f"{rel}: {mode} inventory_policy drop must "
|
|
f"realize gp_per_hour 0 (dropped logs produce no "
|
|
f"income; log_price is reference only) — got "
|
|
f"{rates.get('gp_per_hour')}")
|
|
else:
|
|
price = rates.get("log_price")
|
|
if isinstance(logs, (int, float)) and isinstance(price, (int, float)):
|
|
gp_expect = t_logs * price
|
|
if abs(rates.get("gp_per_hour", -1) - gp_expect) / gp_expect > 0.03:
|
|
errors.append(f"{rel}: {mode} gp_per_hour "
|
|
f"{rates.get('gp_per_hour')} must equal "
|
|
f"logs_per_hour x declared log_price "
|
|
f"({gp_expect:.0f}) within 3%")
|
|
|
|
# --- per-account fixtures: selected-row + 27/28 capacity derivation ---
|
|
for fx in data.get("woodcutting_fixtures") or []:
|
|
name = fx.get("account", "?")
|
|
mode = fx.get("mode")
|
|
wc, atk = fx.get("woodcutting_level"), fx.get("attack_level")
|
|
qgate = bool(fx.get("quest_gate"))
|
|
combat = fx.get("combat_level", 0)
|
|
modes_by_name = {str(m.get("mode")): m for m in modes}
|
|
m = modes_by_name.get(str(mode))
|
|
if m is None:
|
|
errors.append(f"{rel}: fixture '{name}' references unknown "
|
|
f"mode {mode!r}")
|
|
continue
|
|
row = select_ladder_row(m.get("ladder") or [], wc, qgate, combat)
|
|
if row is None:
|
|
errors.append(f"{rel}: fixture '{name}' (WC {wc}, quest "
|
|
f"{qgate}, combat {combat}) matches no ladder row")
|
|
continue
|
|
if row["tree"] != fx.get("expected_tree"):
|
|
errors.append(f"{rel}: fixture '{name}' selected row "
|
|
f"{row['tree']}@{row['min_level']} but declares "
|
|
f"expected_tree {fx.get('expected_tree')}")
|
|
axe, eq = best_axe(wc, atk)
|
|
if axe != fx.get("expected_axe") or eq != fx.get("expected_equipped"):
|
|
errors.append(f"{rel}: fixture '{name}' — recomputed axe "
|
|
f"{axe}/equipped={eq}, declares "
|
|
f"{fx.get('expected_axe')}/equipped="
|
|
f"{fx.get('expected_equipped')}")
|
|
capacity = 28 if eq else 27 # governor 10398 finding 4
|
|
rr = row_rates(row, m.get("model") or {}, m.get("inventory_policy"), capacity)
|
|
if rr is None:
|
|
errors.append(f"{rel}: fixture '{name}' rate chain does not "
|
|
f"compute (capacity {capacity})")
|
|
continue
|
|
f_logs, f_xp, f_gp = rr
|
|
# fixture values are pinned to the recomputed chain within the same
|
|
# tolerances as the mode rates (logs 1% / xp 2% / gp 3%); drop-mode
|
|
# fixtures must realize zero gp.
|
|
expect_logs = fx.get("expected_logs_per_hour")
|
|
if not isinstance(expect_logs, (int, float)) or abs(expect_logs - f_logs) / f_logs > 0.01:
|
|
errors.append(f"{rel}: fixture '{name}' expected_logs_per_hour "
|
|
f"{expect_logs} must equal the selected-row chain "
|
|
f"({row['tree']}@{row['min_level']}, capacity "
|
|
f"{capacity}, respawn {row.get('respawn_duty')}, "
|
|
f"equipped={eq}) = {f_logs:.1f} within 1%")
|
|
expect_xp = fx.get("expected_xp_per_hour")
|
|
if not isinstance(expect_xp, (int, float)) or abs(expect_xp - f_xp) / f_xp > 0.02:
|
|
errors.append(f"{rel}: fixture '{name}' expected_xp_per_hour "
|
|
f"{expect_xp} != selected-row xp {f_xp:.0f} within 2%")
|
|
if m.get("inventory_policy") == "drop":
|
|
if fx.get("expected_gp_per_hour", -1) != 0:
|
|
errors.append(f"{rel}: fixture '{name}' is drop mode — "
|
|
f"realized expected_gp_per_hour must be 0")
|
|
else:
|
|
expect_gp = fx.get("expected_gp_per_hour")
|
|
if expect_gp is None or abs(expect_gp - f_gp) / f_gp > 0.03:
|
|
errors.append(f"{rel}: fixture '{name}' expected_gp_per_hour "
|
|
f"{expect_gp} != selected-row gp {f_gp:.0f} "
|
|
f"within 3%")
|
|
|
|
# --- state-machine wiring (governor 10398 findings 1-3) ---
|
|
sm = data.get("state_machine") or {}
|
|
states = set(sm.get("states", {}))
|
|
if "prepare" not in states:
|
|
errors.append(f"{rel}: state_machine must declare a `prepare` state "
|
|
f"(executable axe acquisition before walking to trees — "
|
|
f"governor 10398 finding 1)")
|
|
else:
|
|
tr = sm.get("transitions") or []
|
|
from_to = {(t.get("from"), t.get("to")) for t in tr}
|
|
prep_f = sum(1 for t in tr if t.get("from") == "prepare" and t.get("to") == "walk_to_trees")
|
|
if not prep_f:
|
|
errors.append(f"{rel}: `prepare` must transition to walk_to_trees "
|
|
f"when the axe is acquired (governor 10398 finding 1)")
|
|
if ("prepare", "failed") not in from_to:
|
|
errors.append(f"{rel}: `prepare` must transition to `failed` when "
|
|
f"no axe is obtainable after bounded recovery — a "
|
|
f"missing tool is a FAILED run, never `complete` "
|
|
f"(governor 10398 finding 2)")
|
|
# idle -> complete must not be the no-axe escape hatch
|
|
for t in tr:
|
|
if t.get("from") == "idle" and t.get("to") == "complete":
|
|
if re.search(r"no axe|no-axe|obtainable", str(t.get("when", "")), re.I):
|
|
errors.append(f"{rel}: idle -> complete must fire only on "
|
|
f"the session target, never on a missing axe "
|
|
f"(governor 10398 finding 2)")
|
|
# inventory-full drop transition gated to the drop policy mode only
|
|
drop_trans = [t for t in (sm.get("transitions") or [])
|
|
if t.get("from") == "chopping" and t.get("to") == "drop_logs"]
|
|
bank_trans = [t for t in (sm.get("transitions") or [])
|
|
if t.get("from") == "chopping" and t.get("to") == "walk_to_bank"]
|
|
if drop_trans and "afk-xp" not in str(drop_trans[0].get("when", "")):
|
|
errors.append(f"{rel}: chopping -> drop_logs must be gated explicitly "
|
|
f"to the afk-xp drop mode (inventory_policy drop) — "
|
|
f"governor 10398 finding 3")
|
|
if not drop_trans and bank_trans:
|
|
# drop mode exists somewhere in the modes; if the entry declares a
|
|
# drop policy it must also declare the drop transition
|
|
if any(str(m.get("inventory_policy")) == "drop" for m in modes):
|
|
errors.append(f"{rel}: a drop-policy mode exists but chopping has "
|
|
f"no drop_logs transition (finding 3)")
|
|
return errors
|
|
|
|
|
|
def run_selftest(verbose=False):
|
|
"""Regression fixtures for the GE floor-tax + lifecycle gates; returns
|
|
error strings."""
|
|
errors = []
|
|
|
|
def check(name, passed):
|
|
if verbose:
|
|
print(f"SELFTEST {'PASS' if passed else 'FAIL'} {name}")
|
|
if not passed:
|
|
errors.append(f"selftest: {name}")
|
|
|
|
fixtures = [
|
|
# name, tags, economy, expect_error
|
|
("fractional-tax flipping entry", ["flipping"],
|
|
{"income_per_cycle": 244, "cost_per_cycle": 223, "net_per_cycle": 16.12}, True),
|
|
# 5000 - floor(5000*0.02) - 3000 = 1900 != 2000: this fixture's
|
|
# economics deliberately do NOT satisfy the flip equation, so the
|
|
# old `ge`-tag scoping would false-positive on it (2000 != 1900).
|
|
("non-margin entry with only 'ge' + 'processing'", ["ge", "processing"],
|
|
{"income_per_cycle": 5000, "cost_per_cycle": 3000, "net_per_cycle": 2000}, False),
|
|
("correctly-floored flipping entry", ["flipping", "merchanting"],
|
|
{"income_per_cycle": 244, "cost_per_cycle": 223, "net_per_cycle": 17}, False),
|
|
# sell 300,000,000 -> uncapped floor tax is 6,000,000; the per-item
|
|
# cap makes it 5,000,000, so the correct net is 1,000,000. The old
|
|
# uncapped rule demanded net=0 and rejected this valid entry.
|
|
("high-value flip above the 5,000,000 GP per-item tax cap",
|
|
["flipping"],
|
|
{"income_per_cycle": 300_000_000, "cost_per_cycle": 294_000_000,
|
|
"net_per_cycle": 1_000_000}, False),
|
|
]
|
|
for name, tags, eco, expect_error in fixtures:
|
|
rel = f"selftest/{name}"
|
|
got_error = ge_floor_tax_error(rel, {"tags": tags, "economy": eco}) is not None
|
|
passed = got_error == expect_error
|
|
if verbose:
|
|
print(f"SELFTEST {'PASS' if passed else 'FAIL'} {name}")
|
|
if not passed:
|
|
errors.append(
|
|
f"selftest: '{name}' expected "
|
|
f"{'an error' if expect_error else 'no error'} but got "
|
|
f"{'an error' if got_error else 'no error'}")
|
|
|
|
# --- per-slot scheduler dispatch: the worked example as a regression ---
|
|
# Governor 10323 finding 3 + owner: reproduce the simultaneous
|
|
# partial-buy / full-buy-fill / no-fill-buy case and prove no
|
|
# unrelated slot is closed or advanced. Under governor 10390 finding 2
|
|
# a FULL buy fill goes to buy-filled-awaiting-collect (assets sit in
|
|
# the GE collection box) — the pass dispatches ge_collect, it never
|
|
# lets the slot sell directly.
|
|
slot_states = {"arrowtips": "buy-open", # partial fill 4,000/10,000 — resting
|
|
"iron": "buy-filled-awaiting-collect", # full fill — ge_collect this pass
|
|
"cosmic": "buy-open"} # no fill, edge positive — resting
|
|
dispatched = {name: scheduler_dispatch(s) for name, s in slot_states.items()}
|
|
ok = dispatched == {"arrowtips": None, "iron": "collect", "cosmic": None}
|
|
check("worked example: partial-buy + full-buy-fill + no-fill slots dispatch only the iron slot to ge_collect; unrelated slots stay untouched",
|
|
ok)
|
|
check("resting slots (buy-open) are never closed or advanced by a pass",
|
|
dispatched.get("arrowtips") is None and dispatched.get("cosmic") is None)
|
|
check("a fully filled buy must pass through buy-filled-awaiting-collect (ge_collect) before any sell",
|
|
scheduler_dispatch("buy-filled-awaiting-collect") == "collect"
|
|
and scheduler_dispatch("sell-filled-awaiting-collect") == "collect"
|
|
and scheduler_dispatch("ready-to-sell") == "sell")
|
|
|
|
# --- side-aware conservation invariants (finding 4) ---
|
|
# BUY balanced snapshot mirroring the worked example t1: 10,000 Rune
|
|
# arrowtips quoted @ 223; 4,000 filled (units in the GE collection
|
|
# box), 6,000 still open on the resting offer; cash 2,230,000 =
|
|
# spent 892,000 + still_committed 1,338,000 + refunded 0.
|
|
buy_partial = {
|
|
"side": "buy",
|
|
"quoted": {"Rune arrowtips": 10_000},
|
|
"filled": {"Rune arrowtips": 4_000},
|
|
"still_open": {"Rune arrowtips": 6_000},
|
|
"cancelled_unfilled": {},
|
|
"cash_quoted": 2_230_000, "spent": 892_000,
|
|
"still_committed": 1_338_000, "refunded": 0,
|
|
}
|
|
check("conservation: BUY side — partial fill splits units into filled + still_open and cash into spent + still_committed (partition sums hold, zero violations)",
|
|
conservation_violations(buy_partial) == [])
|
|
buy_cancelled = dict(buy_partial, still_open={},
|
|
cancelled_unfilled={"Rune arrowtips": 6_000},
|
|
still_committed=0, refunded=1_338_000)
|
|
check("conservation: BUY side — a cancelled partial buy carries filled units + refunded CASH (still_open -> cancelled_unfilled + refunded), zero violations",
|
|
conservation_violations(buy_cancelled) == [])
|
|
phantom_rec = dict(buy_cancelled, refunded={"Rune arrowtips": 6_000})
|
|
check("conservation: BUY side — 'refunded UNITS' on a buy is a phantom (unfilled/cancelled quantity is CASH): violation",
|
|
any("CASH" in v or "invalid for side" in v
|
|
for v in conservation_violations(phantom_rec)))
|
|
sold_on_buy = dict(buy_partial, sold={"Rune arrowtips": 4_000})
|
|
check("conservation: BUY side — a full buy that sells before ge_collect (sold units on a buy ledger) is a violation",
|
|
any("invalid for side" in v for v in conservation_violations(sold_on_buy)))
|
|
buy_cash_bad = dict(buy_partial, still_committed=1_380_000)
|
|
check("conservation: BUY side — cash partition mismatch (spent + still_committed + refunded != cash_quoted) is a violation",
|
|
any("cash quoted" in v for v in conservation_violations(buy_cash_bad)))
|
|
# SELL balanced: 10,000 sold @ 157, proceeds 1,570,000 in the box.
|
|
sell_full = {
|
|
"side": "sell",
|
|
"quoted": {"Iron bar": 10_000},
|
|
"sold": {"Iron bar": 10_000},
|
|
"still_open": {}, "returned_unsold": {},
|
|
"proceeds_in_box": 1_570_000, "cash_collected": 0,
|
|
}
|
|
check("conservation: SELL side — full sell partitions sold + still_open + returned_unsold, proceeds in the box (zero violations)",
|
|
conservation_violations(sell_full) == [])
|
|
sell_partial = dict(sell_full, sold={"Iron bar": 4_000},
|
|
still_open={"Iron bar": 6_000},
|
|
proceeds_in_box=628_000)
|
|
check("conservation: SELL side — a partial sell legitimately spans sold + still_open (zero violations)",
|
|
conservation_violations(sell_partial) == [])
|
|
sell_dup = dict(sell_full, sold={"Iron bar": 6_000},
|
|
still_open={"Iron bar": 3_000},
|
|
returned_unsold={"Iron bar": 1_000})
|
|
check("conservation: SELL side — units both in a live offer AND returned (impossible pair) is a violation",
|
|
any("both still_open and returned_unsold" in v
|
|
for v in conservation_violations(sell_dup)))
|
|
over_rec = dict(buy_partial, filled={"Rune arrowtips": 7_000})
|
|
check("conservation: over-reported buckets break the quoted partition (sum 13,000 != quoted 10,000)",
|
|
any("quoted 10000 !=" in v for v in conservation_violations(over_rec)))
|
|
neg_rec = dict(sell_full, sold={"Iron bar": -1})
|
|
check("conservation: a negative bucket is a violation",
|
|
any("negative" in v for v in conservation_violations(neg_rec)))
|
|
|
|
# --- phase gates (finding 4: assets cannot be reused/closed pre-collect) ---
|
|
check("phase gate: a full buy that sells before ge_collect (buy-filled-awaiting-collect with sold units) is rejected",
|
|
any("cannot sell before ge_collect" in v
|
|
for v in slot_phase_violations(dict(buy_partial, sub_state="buy-filled-awaiting-collect",
|
|
filled={"Rune arrowtips": 10_000}, still_open={},
|
|
sold={"Rune arrowtips": 10_000}))))
|
|
check("phase gate: a full sell that closes before proceeds collection (closed with proceeds_in_box > 0) is rejected",
|
|
any("before proceeds collection" in v
|
|
for v in slot_phase_violations(dict(sell_full, sub_state="closed"))))
|
|
check("phase gate: a sell-filled-awaiting-collect slot with sold units but no proceeds_in_box is rejected",
|
|
any("no proceeds_in_box" in v
|
|
for v in slot_phase_violations(dict(sell_full, sub_state="sell-filled-awaiting-collect",
|
|
proceeds_in_box=0))))
|
|
check("phase gate: a closed slot that has been fully collected (no proceeds_in_box, no cancelled/returned units) passes",
|
|
slot_phase_violations(dict(sell_full, sub_state="closed",
|
|
proceeds_in_box=0, cash_collected=1_570_000)) == [])
|
|
|
|
# --- 4h buy-limit ledger vs offer expiry (finding 1) ---
|
|
check("buy limit: a requote within the remaining capacity is allowed (4,000 used of 10,000 -> 6,000)",
|
|
buy_capacity_ok(limit_used=4000, limit=10000, qty_requested=6000))
|
|
check("buy limit: a requote beyond the remaining capacity is blocked (6,001 > 6,000 remaining)",
|
|
not buy_capacity_ok(limit_used=4000, limit=10000, qty_requested=6001))
|
|
check("buy limit: a cancelled offer does NOT renew the limit (10,000 used of 10,000 -> any requote blocked before reset)",
|
|
not buy_capacity_ok(limit_used=10000, limit=10000, qty_requested=1))
|
|
|
|
# --- structured lifecycle gates (findings 1-5 + governor 10390) ---
|
|
margin_tags = ["flipping"]
|
|
ssm_ok = {
|
|
"sub_states": SLOT_SUB_STATES,
|
|
"slot_transitions": {
|
|
"free": ["buy-open"],
|
|
"buy-open": ["buy-filled-awaiting-collect",
|
|
"buy-cancelled-awaiting-collect"],
|
|
"buy-filled-awaiting-collect": ["ready-to-sell", "free"],
|
|
"buy-cancelled-awaiting-collect": ["ready-to-sell", "ready-to-requote", "free"],
|
|
"ready-to-sell": ["sell-open"],
|
|
"sell-open": ["sell-filled-awaiting-collect",
|
|
"sell-cancelled-awaiting-collect"],
|
|
"sell-filled-awaiting-collect": ["closed"],
|
|
"sell-cancelled-awaiting-collect": ["ready-to-requote", "closed"],
|
|
"ready-to-requote": ["buy-open", "sell-open", "free"],
|
|
"closed": ["free"], # archival release: physical slot reusable (governor 10471)
|
|
},
|
|
"slot_transition_whens": [
|
|
"free -> buy-open: quote placed",
|
|
"buy-open -> buy-filled-awaiting-collect: offer FULLY filled — units sit in the GE collection box until ge_collect",
|
|
"buy-open -> buy-cancelled-awaiting-collect: abort on stale edge (margin no longer positive) or strategy reallocation — never on the 4h limit reset",
|
|
"buy-filled-awaiting-collect -> ready-to-sell: ge_collect withdrawn units; sell edge positive",
|
|
"buy-filled-awaiting-collect -> free: ge_collect withdrawn; margin gone, slot released",
|
|
"buy-cancelled-awaiting-collect -> ready-to-sell: collected, sell edge positive",
|
|
"buy-cancelled-awaiting-collect -> ready-to-requote: collected; margin positive and capacity remains",
|
|
"buy-cancelled-awaiting-collect -> free: collected, full cash refund, slot freed",
|
|
"ready-to-sell -> sell-open: sell offer placed",
|
|
"sell-open -> sell-filled-awaiting-collect: sell FULLY filled — proceeds sit in the box until ge_collect",
|
|
"sell-open -> sell-cancelled-awaiting-collect: abort on stale edge or strategy reallocation",
|
|
"sell-filled-awaiting-collect -> closed: proceeds collected and ledger reconciled + ARCHIVED",
|
|
"sell-cancelled-awaiting-collect -> ready-to-requote: collected, requote",
|
|
"sell-cancelled-awaiting-collect -> closed: collected, ledger archived, slot closed (exit taken)",
|
|
"closed -> free: archival release — completed cycle's ledger stays archived; the physical GE slot is reusable for the next flip",
|
|
"ready-to-requote -> buy-open: requoted buy",
|
|
"ready-to-requote -> sell-open: requoted sell",
|
|
"ready-to-requote -> free: abandoned",
|
|
],
|
|
"scheduler_iteration": "one pass over all slots; dispatch pending actions only",
|
|
"quote_age_policy": "offers rest while the scanned margin stays positive; aborted only on a stale edge or strategy reallocation — the 4h limit reset never cancels an offer",
|
|
"persisted_state": "per-slot record: sub-state + side-aware quoted/filled/sold/collected buckets",
|
|
"limit_ledger": "limit_used + first_fill_ts + limit_resets_at, independent of offer expiry; cancellation never renews it",
|
|
"conservation": "side-aware: buy quoted units = filled + still_open + cancelled_unfilled and acquired items = filled only; sell quoted = sold + still_open + returned_unsold",
|
|
"break_resume": "breaks between passes; state persists in the per-slot record",
|
|
}
|
|
flip_ok = {"tags": margin_tags, "economy": {
|
|
"income_per_cycle": 244, "cost_per_cycle": 223, "net_per_cycle": 17,
|
|
"ceiling_gp_per_hour": 149500, "gp_per_hour_low": 102600,
|
|
"gp_per_hour_high": 138800}, "slot_state_machine": ssm_ok}
|
|
check("flip lifecycle: ceiling + nested realized bounds + canonical 10-state slot machine passes",
|
|
ge_lifecycle_errors("ok.yaml", flip_ok) == [])
|
|
errs = ge_lifecycle_errors("bad.yaml", {"tags": margin_tags, "economy": {
|
|
"income_per_cycle": 244, "cost_per_cycle": 223, "net_per_cycle": 17,
|
|
"ceiling_gp_per_hour": 149500, "gp_per_hour_low": 160000,
|
|
"gp_per_hour_high": 138800}})
|
|
check("flip lifecycle: realized low above the ceiling is rejected (bounds must nest)",
|
|
any("nest" in e for e in errs))
|
|
errs = ge_lifecycle_errors("bad2.yaml", {"tags": margin_tags, "economy": {
|
|
"income_per_cycle": 244, "cost_per_cycle": 223, "net_per_cycle": 17,
|
|
"gp_per_hour_low": 0, "gp_per_hour_high": 138800}})
|
|
check("flip lifecycle: missing typed ceiling field is rejected",
|
|
any("ceiling_gp_per_hour" in e for e in errs))
|
|
errs = ge_lifecycle_errors("bad3.yaml", dict(flip_ok, slot_state_machine=dict(
|
|
ssm_ok, sub_states=["free", "buy-open"])))
|
|
check("flip lifecycle: non-canonical sub-state set is rejected",
|
|
any("canonical" in e for e in errs))
|
|
errs = ge_lifecycle_errors("bad4.yaml", dict(flip_ok, slot_state_machine=dict(
|
|
ssm_ok, slot_transitions={"free": ["buy-open"],
|
|
"buy-open": ["ready-to-sell",
|
|
"buy-cancelled-awaiting-collect"]},
|
|
slot_transition_whens=ssm_ok["slot_transition_whens"][:4])))
|
|
check("flip lifecycle: a sub-state without transitions (ready-to-sell missing) is rejected",
|
|
any("no transitions" in e for e in errs))
|
|
errs = ge_lifecycle_errors("bad5.yaml", dict(flip_ok, slot_state_machine=dict(
|
|
ssm_ok, slot_transitions=dict(ssm_ok["slot_transitions"], closed=[]))))
|
|
check("flip lifecycle: a 'closed' sink (no archival release) is rejected — the physical slot would perform one flip and strand",
|
|
any("archival release" in e for e in errs))
|
|
|
|
# --- slot reuse through rotations (governor 10471) ---
|
|
check("slot cycle: the archival release closed -> free is a dispatched scheduler action",
|
|
scheduler_dispatch("closed") == "release")
|
|
check("slot reuse: one full buy/collect/sell/collect lifecycle completes and the SAME physical slot opens a second buy (two-rotation walk passes)",
|
|
slot_reuse_violations(ssm_ok["slot_transitions"]) == [])
|
|
check("slot reuse: the rotation-1 archived ledger survives rotation 2 intact (no loss, duplication, or mutation)",
|
|
archived_ledger_preserved_after_second_buy() == [])
|
|
sink_trans = dict(ssm_ok["slot_transitions"], closed=[])
|
|
check("slot reuse: a machine whose closed has no outgoing transition FAILS the two-rotation regression (one flip, then permanently unusable)",
|
|
any("permanently unusable" in v
|
|
for v in slot_reuse_violations(sink_trans)))
|
|
closed_no_free = dict(ssm_ok["slot_transitions"], closed=["ready-to-sell"])
|
|
check("slot reuse: a closed that does not release to free FAILS the two-rotation regression",
|
|
any("closed -> free" in v
|
|
for v in slot_reuse_violations(closed_no_free)))
|
|
|
|
# --- woodcutting structured gates (owner 10288 / governor 10398) ---
|
|
check("axe: 41-Woodcutting/1-Attack account carries and USES a rune axe (does not pick a lower axe)",
|
|
best_axe(41, 1) == ("rune", False))
|
|
check("axe: 41-Woodcutting/40-Attack account equips the rune axe",
|
|
best_axe(41, 40) == ("rune", True))
|
|
check("axe: 30-Woodcutting account is below adamant (31) and uses mithril (equippable at 20 Attack)",
|
|
best_axe(30, 40) == ("mithril", True))
|
|
check("axe: 31-Woodcutting/5-Attack account uses adamant but cannot equip it (carries)",
|
|
best_axe(31, 5) == ("adamant", False))
|
|
check("axe: level-1 account uses an iron axe equipped from the start",
|
|
best_axe(1, 1) == ("iron", True))
|
|
check("axe: dragon (61/60, members) is never selected for an F2P woodcutting entry; maxed account still picks the top F2P axe (rune)",
|
|
best_axe(99, 99) == ("rune", True))
|
|
canon = {(row[0], row[1], row[2]) for row in AXE_TIERS} - {("dragon", 61, 60)}
|
|
want = {("bronze", 1, 1), ("iron", 1, 1), ("steel", 6, 5), ("black", 11, 10),
|
|
("mithril", 21, 20), ("adamant", 31, 30), ("rune", 41, 40), ("gilded", 41, 40)}
|
|
check("axe: canonical F2P axe table matches the wiki (WC to use / Attack to equip)",
|
|
canon == want)
|
|
|
|
def wc_fake_entry(**over):
|
|
base = {"tags": ["woodcutting"],
|
|
"axe_tiers": [{"axe": a, "woodcutting_level": w, "attack_level": k, "members": m}
|
|
for a, w, k, m in AXE_TIERS],
|
|
"axe_examples": [{"account": "41WC/1Atk", "woodcutting_level": 41, "attack_level": 1,
|
|
"expected_axe": "rune", "expected_equipped": False}],
|
|
"state_machine": {"states": {"idle": {"goal": "start", "next": ["arm_run"]},
|
|
"arm_run": {"goal": "pick", "next": ["prepare"]},
|
|
"prepare": {"goal": "acquire axe", "next": ["walk_to_trees", "failed"]},
|
|
"chopping": {"goal": "chop", "next": ["drop_logs", "walk_to_bank"]},
|
|
"drop_logs": {"goal": "drop", "next": ["chopping"]},
|
|
"walk_to_bank": {"goal": "bank", "next": ["chopping"]},
|
|
"failed": {"goal": "fail"}},
|
|
"initial": "idle", "terminal": ["failed"],
|
|
"transitions": [
|
|
{"from": "idle", "when": "session target reached", "to": "complete"},
|
|
{"from": "arm_run", "when": "row pinned", "to": "prepare"},
|
|
{"from": "prepare", "when": "axe acquired", "to": "walk_to_trees"},
|
|
{"from": "prepare", "when": "axe unobtainable", "to": "failed"},
|
|
{"from": "chopping", "when": "mode is afk-xp (inventory_policy drop) and inventory full", "to": "drop_logs"},
|
|
{"from": "chopping", "when": "mode is fast-xp or banked-income and inventory full", "to": "walk_to_bank"}]},
|
|
"woodcutting_fixtures": [
|
|
{"account": "f1", "mode": "fast-xp", "woodcutting_level": 50, "attack_level": 40,
|
|
"quest_gate": False, "combat_level": 50, "expected_tree": "willow",
|
|
"expected_axe": "rune", "expected_equipped": True,
|
|
"expected_logs_per_hour": 622, "expected_xp_per_hour": 41985,
|
|
"expected_gp_per_hour": 13062}],
|
|
"woodcutting_modes": [
|
|
{"mode": "fast-xp", "intent": "max xp per hour on the F2P ladder",
|
|
"inventory_policy": "bank",
|
|
"ladder": [
|
|
{"tree": "willow", "min_level": 30, "gate": "combat-15-plus",
|
|
"spot": "draynor willows", "bank": "draynor",
|
|
"chop_seconds_per_log": 4.0, "walk_seconds_each_way": 12,
|
|
"respawn_duty": 0.92, "log_price": 21},
|
|
{"tree": "willow", "min_level": 30, "gate": "combat-under-15",
|
|
"spot": "edgeville willow", "bank": "edgeville",
|
|
"chop_seconds_per_log": 4.0, "walk_seconds_each_way": 6,
|
|
"respawn_duty": 0.90, "log_price": 21},
|
|
{"tree": "oak", "min_level": 15, "gate": "none",
|
|
"spot": "draynor oaks", "bank": "draynor",
|
|
"chop_seconds_per_log": 3.5, "walk_seconds_each_way": 8,
|
|
"respawn_duty": 0.93, "log_price": 40},
|
|
{"tree": "tree", "min_level": 1, "gate": "none",
|
|
"spot": "lumbridge west", "bank": "lumbridge",
|
|
"chop_seconds_per_log": 3.0, "walk_seconds_each_way": 10,
|
|
"respawn_duty": 0.95, "log_price": 23}],
|
|
"model": {"drop_seconds_per_log": 0, "deposit_seconds": 4,
|
|
"break_duty": 0.94},
|
|
"rates": {"logs_per_hour": 622, "xp_per_hour": 41985,
|
|
"gp_per_hour": 13062, "log_price": 21,
|
|
"price_verified": "2026-08-28"}},
|
|
{"mode": "afk-xp", "intent": "low-interaction quest-gated progress",
|
|
"inventory_policy": "drop",
|
|
"ladder": [
|
|
{"tree": "maple", "min_level": 45, "gate": "dragon-slayer-i",
|
|
"spot": "corsair cove resource area", "bank": "none-drop",
|
|
"chop_seconds_per_log": 6.0, "walk_seconds_each_way": 0,
|
|
"respawn_duty": 0.80, "log_price": 12},
|
|
{"tree": "willow", "min_level": 30, "gate": "combat-15-plus",
|
|
"spot": "draynor willows", "bank": "none-drop",
|
|
"chop_seconds_per_log": 6.0, "walk_seconds_each_way": 0,
|
|
"respawn_duty": 0.92, "log_price": 21},
|
|
{"tree": "oak", "min_level": 15, "gate": "none",
|
|
"spot": "draynor oaks", "bank": "none-drop",
|
|
"chop_seconds_per_log": 5.5, "walk_seconds_each_way": 0,
|
|
"respawn_duty": 0.93, "log_price": 40},
|
|
{"tree": "tree", "min_level": 1, "gate": "none",
|
|
"spot": "lumbridge west", "bank": "none-drop",
|
|
"chop_seconds_per_log": 5.0, "walk_seconds_each_way": 0,
|
|
"respawn_duty": 0.95, "log_price": 23}],
|
|
"model": {"drop_seconds_per_log": 1.0, "deposit_seconds": 0,
|
|
"break_duty": 0.94},
|
|
"rates": {"logs_per_hour": 386, "xp_per_hour": 38600,
|
|
"gp_per_hour": 0, "log_price": 12,
|
|
"price_verified": "2026-08-28"}},
|
|
{"mode": "banked-income", "intent": "banked logs sold at the GE",
|
|
"inventory_policy": "bank",
|
|
"ladder": [
|
|
{"tree": "yew", "min_level": 60, "gate": "none",
|
|
"spot": "edgeville south yews", "bank": "edgeville",
|
|
"chop_seconds_per_log": 7.5, "walk_seconds_each_way": 8,
|
|
"respawn_duty": 0.52, "log_price": 111},
|
|
{"tree": "willow", "min_level": 30, "gate": "combat-15-plus",
|
|
"spot": "draynor willows", "bank": "draynor",
|
|
"chop_seconds_per_log": 4.0, "walk_seconds_each_way": 12,
|
|
"respawn_duty": 0.92, "log_price": 21},
|
|
{"tree": "oak", "min_level": 15, "gate": "none",
|
|
"spot": "draynor oaks", "bank": "draynor",
|
|
"chop_seconds_per_log": 3.5, "walk_seconds_each_way": 8,
|
|
"respawn_duty": 0.93, "log_price": 40},
|
|
{"tree": "tree", "min_level": 1, "gate": "none",
|
|
"spot": "lumbridge west", "bank": "lumbridge",
|
|
"chop_seconds_per_log": 3.0, "walk_seconds_each_way": 10,
|
|
"respawn_duty": 0.95, "log_price": 23}],
|
|
"model": {"drop_seconds_per_log": 0, "deposit_seconds": 4,
|
|
"break_duty": 0.94},
|
|
"rates": {"logs_per_hour": 214, "xp_per_hour": 37450,
|
|
"gp_per_hour": 23754, "log_price": 111,
|
|
"price_verified": "2026-08-28"}}]}
|
|
base.update(over)
|
|
return base
|
|
|
|
check("modes: a compliant 3-mode entry (per-row rates, drop-GP-zero, prepare wiring) passes every structured gate",
|
|
woodcutting_errors("selftest/wc-good", wc_fake_entry()) == [])
|
|
bad = wc_fake_entry(woodcutting_modes=wc_fake_entry()["woodcutting_modes"][1:])
|
|
check("modes: missing a mode (only 2 declared) is rejected",
|
|
any("exactly" in e for e in woodcutting_errors("selftest/wc-missing", bad)))
|
|
bad = wc_fake_entry(axe_examples=[{"account": "41WC/1Atk", "woodcutting_level": 41, "attack_level": 1,
|
|
"expected_axe": "adamant", "expected_equipped": True}])
|
|
check("modes: a 41-WC/1-Attack example declaring a lower/equipped axe is rejected",
|
|
any("recomputed rune" in e for e in woodcutting_errors("selftest/wc-badex", bad)))
|
|
bad = wc_fake_entry(woodcutting_modes=[dict(m, ladder=[dict(r, min_level=30 if r["tree"] == "maple" else r["min_level"]) for r in m["ladder"]])
|
|
for m in wc_fake_entry()["woodcutting_modes"]])
|
|
check("modes: maple below level 45 is rejected",
|
|
any("maple must have min_level 45" in e for e in woodcutting_errors("selftest/wc-maple45", bad)))
|
|
bad = wc_fake_entry(woodcutting_modes=[dict(m, ladder=[dict(r, gate="none") for r in m["ladder"]])
|
|
for m in wc_fake_entry()["woodcutting_modes"]])
|
|
check("modes: maple without the dragon-slayer-i gate is rejected",
|
|
any("gate dragon-slayer-i" in e for e in woodcutting_errors("selftest/wc-maplegate", bad)))
|
|
bad = wc_fake_entry(woodcutting_modes=[dict(m, ladder=[dict(r) for r in m["ladder"][::-1]])
|
|
for m in wc_fake_entry()["woodcutting_modes"]])
|
|
check("modes: a ladder not ordered by min_level DESC is rejected (nondeterministic)",
|
|
any("ordered by min_level DESC" in e for e in woodcutting_errors("selftest/wc-order", bad)))
|
|
badm = [dict(m, rates=dict(m["rates"], logs_per_hour=9999))
|
|
for m in wc_fake_entry()["woodcutting_modes"]]
|
|
check("modes: a rate far above the model chain (9999/hr) is rejected",
|
|
any("SELECTED-row" in e for e in woodcutting_errors("selftest/wc-rate", wc_fake_entry(woodcutting_modes=badm))))
|
|
bad = wc_fake_entry(axe_tiers=[{"axe": a, "woodcutting_level": w, "attack_level": k, "members": m}
|
|
for a, w, k, m in AXE_TIERS if a != "rune"])
|
|
check("modes: a non-canonical axe table (rune missing) is rejected",
|
|
any("canonical F2P table" in e for e in woodcutting_errors("selftest/wc-axes", bad)))
|
|
badm = wc_fake_entry()["woodcutting_modes"]
|
|
badm[0] = dict(badm[0], rates=dict(badm[0]["rates"], xp_per_hour=40000))
|
|
check("modes: xp_per_hour not equal to logs x per-log xp is rejected",
|
|
any("xp_per_hour" in e for e in woodcutting_errors("selftest/wc-xp", wc_fake_entry(woodcutting_modes=badm))))
|
|
# governor 10398 finding 4: a fixture whose expected logs/XP do not match
|
|
# the selected-row chain with the 27/28 capacity is rejected.
|
|
bad = wc_fake_entry(woodcutting_fixtures=[
|
|
{"account": "carried-rune-27", "mode": "afk-xp", "woodcutting_level": 50, "attack_level": 1,
|
|
"quest_gate": True, "combat_level": 50, "expected_tree": "maple",
|
|
"expected_axe": "rune", "expected_equipped": False,
|
|
"expected_logs_per_hour": 9999, "expected_xp_per_hour": 999999,
|
|
"expected_gp_per_hour": 0}])
|
|
check("modes: a fixture whose declared rates do not match the selected-row 27-slot chain is rejected (governor 10398 finding 4)",
|
|
any("selected-row chain" in e for e in woodcutting_errors("selftest/wc-fxrate", bad)))
|
|
# governor 10398 finding 5: a drop mode declaring non-zero realized GP.
|
|
badm = wc_fake_entry()["woodcutting_modes"]
|
|
badm[1] = dict(badm[1], rates=dict(badm[1]["rates"], gp_per_hour=4632))
|
|
check("modes: drop mode with non-zero realized gp_per_hour is rejected (dropped logs realize 0 gp — governor 10398 finding 5)",
|
|
any("realize gp_per_hour 0" in e for e in woodcutting_errors("selftest/wc-dropgp", wc_fake_entry(woodcutting_modes=badm))))
|
|
# governor 10398 finding 2: idle -> complete must not be the no-axe hatch.
|
|
bad = wc_fake_entry(state_machine=dict(
|
|
wc_fake_entry()["state_machine"],
|
|
transitions=[{"from": "idle", "when": "no axe obtainable", "to": "complete"}]))
|
|
check("modes: idle -> complete on a missing axe is rejected (unobtainable axe must go to failed — governor 10398 finding 2)",
|
|
any("never on a missing axe" in e for e in woodcutting_errors("selftest/wc-idlecomplete", bad)))
|
|
# governor 10398 finding 3: the drop transition must be gated to afk-xp.
|
|
bad = wc_fake_entry(state_machine=dict(
|
|
wc_fake_entry()["state_machine"],
|
|
transitions=[{"from": "chopping", "when": "inventory full", "to": "drop_logs"}]))
|
|
check("modes: an ungated chopping -> drop_logs transition is rejected (drop route exclusive to the afk-xp drop mode — governor 10398 finding 3)",
|
|
any("gated explicitly" in e for e in woodcutting_errors("selftest/wc-dropgate", bad)))
|
|
|
|
return errors
|
|
|
|
|
|
def main():
|
|
global STALE_DAYS
|
|
if "--stale-days" in sys.argv:
|
|
STALE_DAYS = int(sys.argv[sys.argv.index("--stale-days") + 1])
|
|
|
|
errors, warnings = [], []
|
|
if "--selftest" in sys.argv:
|
|
errors += run_selftest(verbose=True)
|
|
print(f"RESULT: selftest, {len(errors)} errors, 0 warnings")
|
|
return 1 if errors else 0
|
|
|
|
# The fix itself is gated: regression fixtures run on every invocation.
|
|
errors += run_selftest(verbose=False)
|
|
entries = load_entries()
|
|
if not entries:
|
|
print("ERROR: no codex entries found under codex/")
|
|
return 1
|
|
|
|
ids = {}
|
|
today = datetime.date.today()
|
|
|
|
for path in entries:
|
|
rel = str(path.relative_to(ROOT))
|
|
try:
|
|
data = yaml.safe_load(path.read_text())
|
|
except yaml.YAMLError as e:
|
|
errors.append(f"{rel}: YAML parse error: {e}")
|
|
continue
|
|
|
|
# 1. schema
|
|
v = jsonschema.Draft7Validator(SCHEMA)
|
|
for err in sorted(v.iter_errors(data), key=lambda e: list(e.path)):
|
|
loc = "/".join(str(p) for p in err.path) or "(root)"
|
|
errors.append(f"{rel} [{loc}]: {err.message}")
|
|
if errors and errors[-1].startswith(rel):
|
|
# schema already broke; cross-checks on a broken doc are noise
|
|
continue
|
|
|
|
eid = data.get("id", rel)
|
|
if eid in ids:
|
|
errors.append(f"{rel}: duplicate entry id '{eid}' (also in {ids[eid]})")
|
|
ids[eid] = rel
|
|
|
|
# 2. state machine consistency
|
|
sm = data.get("state_machine", {})
|
|
states = sm.get("states", {})
|
|
declared = set(states)
|
|
terminals = set(sm.get("terminal", []))
|
|
for sname, sdef in states.items():
|
|
if sname not in terminals and not sdef.get("next"):
|
|
errors.append(f"{rel}: non-terminal state '{sname}' has no 'next'")
|
|
for nxt in sdef.get("next", []):
|
|
if nxt not in declared:
|
|
errors.append(f"{rel}: state '{sname}' next->'{nxt}' not declared")
|
|
if sm.get("initial") not in declared:
|
|
errors.append(f"{rel}: initial state '{sm.get('initial')}' not declared")
|
|
for t in sm.get("transitions", []):
|
|
if t["from"] not in declared:
|
|
errors.append(f"{rel}: transition from '{t['from']}' not declared")
|
|
if t["to"] not in declared:
|
|
errors.append(f"{rel}: transition to '{t['to']}' not declared")
|
|
for term in sm.get("terminal", []):
|
|
if term not in declared:
|
|
errors.append(f"{rel}: terminal '{term}' not declared")
|
|
|
|
# one-cast worked-example regression (owner guidance 2026-08-28,
|
|
# PR #8): monotonic break/restock counters, scoped to the one-cast model
|
|
errors += alch_worked_example_regression(rel, data, path.read_text())
|
|
|
|
# loss-reserve direction + fill-price GP bound regression (owner
|
|
# guidance 2026-08-29 for governor 10361, PR #8), scoped to
|
|
# low-alch-members
|
|
errors += alch_accounting_regression(rel, data, path.read_text())
|
|
|
|
# action id/step uniqueness
|
|
a_ids = [a["id"] for a in data["actions"]]
|
|
a_steps = [a["step"] for a in data["actions"]]
|
|
if len(a_ids) != len(set(a_ids)):
|
|
errors.append(f"{rel}: duplicate action ids")
|
|
if len(a_steps) != len(set(a_steps)):
|
|
errors.append(f"{rel}: duplicate action step names")
|
|
|
|
# GE-margin floor-tax arithmetic (see ge_floor_tax_error): scoped to
|
|
# the unambiguous margin tags flipping/merchanting. The generic `ge`
|
|
# tag alone must not gate this rule — alchemy/processing/procurement
|
|
# entries can carry `ge` with income unrelated to a taxed GE resale.
|
|
err = ge_floor_tax_error(rel, data)
|
|
if err:
|
|
errors.append(err)
|
|
# GE-flip lifecycle gates (per-slot async model, 4h limit ledger vs
|
|
# offer expiry, typed ceiling vs realized scenario bounds).
|
|
errors += ge_lifecycle_errors(rel, data)
|
|
# Woodcutting structured gates (owner 10288 / governor 10398 shape:
|
|
# canonical axe table, deterministic per-mode ladders, per-selected-
|
|
# row dynamic rates with 27/28 capacity, drop-mode realized GP zero).
|
|
errors += woodcutting_errors(rel, data)
|
|
|
|
# 3. staleness / research TODOs
|
|
if data.get("status") == "verified":
|
|
try:
|
|
vdate = datetime.date.fromisoformat(data["verified"])
|
|
age = (today - vdate).days
|
|
if age > STALE_DAYS:
|
|
warnings.append(
|
|
f"{rel}: status=verified but facts are {age}d old "
|
|
f"(> {STALE_DAYS}d) — re-verify or drop to status:stale")
|
|
except ValueError:
|
|
pass
|
|
for line in data.get("best_practice", {}).get("equipment", []) + \
|
|
data.get("best_practice", {}).get("techniques", []):
|
|
if str(line.get("source", "")).startswith("researched"):
|
|
warnings.append(
|
|
f"{rel}: best_practice '{line.get('item') or line.get('name')}' "
|
|
f"carries a 'researched' source — citation TODO, file follow-up")
|
|
|
|
# report
|
|
for w in warnings:
|
|
print(f"WARN {w}")
|
|
for e in errors:
|
|
print(f"ERROR {e}")
|
|
print(f"RESULT: {len(entries)} entries, {len(errors)} errors, {len(warnings)} warnings")
|
|
return 1 if errors else 0
|
|
|
|
|
|
if __name__ == "__main__":
|
|
sys.exit(main())
|