Files
TheTree_mock/docs/plans/original-completion-2026-10-02/execution/mana-proposal-continuation-r03/independent-arithmetic-preflight-r02.json
T

33 lines
2.6 KiB
JSON

{
"recorded_at": "2026-10-13T08:06:24.867850+00:00",
"submitted_commit": "6b78f8fd71131e61ba695939f4629fec9f51d7a9",
"scope": "proposal arithmetic and source applicability; no game acceptance",
"passed": true,
"flow_rows_independently_recomputed": 126,
"comparisons": 21,
"formula": "F=0: available=B+G, consumed=min(available,D), shortage=D-consumed, overflow=max(0,available-consumed-C), after=min(C,available-consumed), global_stop=(after==0)",
"surplus_first_zero_interval": 9,
"surplus_interval_8_after": 16,
"furnace_arithmetic_and_both_headroom_policies_recomputed": true,
"source_pins_current_production_matches": 53,
"changed_paths": [
"docs/plans/original-completion-2026-10-02/execution/mana-proposal/PROPOSAL.md",
"docs/plans/original-completion-2026-10-02/execution/mana-proposal/proposal.json"
],
"product_changed": false,
"original_completed_units_added": 0,
"document_hashes": {
"docs/plans/original-completion-2026-10-02/execution/mana-proposal/PROPOSAL.md": "f063ecfe70c097080bfdbfec92f9da57edfe05bb02af0485e5d8b0430a81d060",
"docs/plans/original-completion-2026-10-02/execution/mana-proposal/proposal.json": "2043eaafd27fb963e804f57b20585aa66cc9682446b4c507bb3ec2e2c3a8dfbc"
},
"registered_validation_source": {
"argv": [
"{python}",
"-B",
"-c",
"import json,hashlib,re\nfrom pathlib import Path\np=Path(\"docs/plans/original-completion-2026-10-02/execution/mana-proposal\")\nj=json.loads((p/\"proposal.json\").read_text());assert j[\"status\"]==\"proposed_unapproved\" and j[\"applied_to_product\"] is False\nfor k in [\"recommended\",\"alternatives\",\"demand_catalog\",\"ordering\",\"legacy_zero\",\"open_decisions\",\"source_pins\",\"comparisons\"]: assert j[k],k\nr=j[\"recommended\"]\nfor k in [\"initial_amount\",\"storage_capacity\",\"world_tree_generation_per_interval\",\"interval_minutes\"]: assert isinstance(r[k],(int,float)) and not isinstance(r[k],bool) and r[k]>0,k\nassert r[\"initial_amount\"]<=r[\"storage_capacity\"]\nfor f,h in j[\"source_pins\"].items():\n q=Path(f);assert not q.is_absolute() and \"..\" not in q.parts;assert hashlib.sha256(q.read_bytes()).hexdigest()==h,f\nrows=j[\"demand_catalog\"];assert len({x[\"definition_id\"] for x in rows})==len(rows)\nfor x in rows:\n q=Path(x[\"path\"]);t=q.read_text();v=re.search(r\"^maintenance_mana\\s*=\\s*([\\d.]+)\",t,re.M);assert (float(v.group(1)) if v else 0)==x[\"observed_maintenance_mana\"],str(q)\nassert (p/\"PROPOSAL.md\").stat().st_size>1000\nprint(\"proposal structure, current-source pins and observed demand validated; no product acceptance implied\")\n"
],
"timeout_seconds": 120
}
}