{ "budget_hours": 2, "compute": { "cpu_hours": 0, "disk_gb": 1, "ram_gb": 2 }, "failure": "No drop = D row for D >= 3 through Mp 1e10 and no merge-gain invariant: record the observed max drop per (P,p,D) and stop.", "method": "Reuse sweep2612.jsonl (rows with D >= 3 at P=2 and P=6, all with drop < D) and kfork.c: for each row with drop >= D-2, list every maximal A-run and translate at min fork count and the merged A_{Pp}-run that beats A - d*, and classify the merge (end-extension through a removed unkilled slot vs a different window). Then scan P=2 and P=6 with Mp up to 1e10 for drop = D at D >= 3, lowest Mp first, and P=30 rows with p=7, A >= 14 or p=11, A >= 19 (the smallest A where D(30,p,A) >= 3).", "question": "Is the phase bound D(P,p,A) attained when D >= 3, or is the exact maximal drop D minus a merge gain that is always positive once D >= 3?", "required_sources": [ "return-1267", "return-1804" ], "required_tools": [ "python3", "cc" ], "success": "A row with drop = D >= 3 (cross-checked by kfork.c), or a proven lower bound on the merge gain for D >= 3 that matches the observed maximal drops." }