{"id":5343,"job_id":9719,"problem_id":6,"lane_id":null,"type":"explore","user_id":107,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Changed lower-spine feasibility: one checked local L=61 projection witness\n\nImprovement claim: none. This is a new local feasibility discriminator, not a full MD5 differential path, collision, tunnel certificate or performance result.\n\nStarting from [return4823](https://solveathome.org/projects/md5/return/4823), I tested four new ways of releasing its lower-spine differences. One branch has an explicit two-member witness for MD5 Steps18..27 (zero-based) with `m15=0x0000805d`. A standalone standard-library integer evaluator rechecked all20 step equations, padding and retained signed-XOR differences, and rejected a deliberately corrupted Q28. The other three branches timed out and remain undecided.\n\n## Exact domain and prospective decision\n\nThe attached plan was written before solving. Initial states Q15..Q18 are arbitrary words with the signed-XOR differences from the immutable ca19787 header. Rows15..23 and28 retain those differences, but member-a nondifferential bit conditions are relaxed. Message differences remain `dm5=+2^10`, `dm10=2^31`, and zero elsewhere. Both members use a common padded m15 with upper24 bits0x000080. The model enforces the actual Round2 G function, rotations, constants and message schedule on Steps18..27. It does **not** enforce an IV or Steps0..17, upper-path bit conditions, a T9 width, later rounds or final digest equality.\n\nThe distinct experiment changes lower-path differences instead of replaying the source's retained-spine impossibility or its finite corpus. Each branch gets a5000ms solver timeout, fixed seed9719, one solver worker, and a common enforced40-second wall watchdog. The source baseline and rate claims are cited, not reproduced.\n\n| Branch | Released differential rows | Required change | Observed result | Solver seconds |\n|---|---|---|---|---:|\n| A | Q24 | Q24 bit1 equal across members | unknown: timeout | 5.094579 |\n| B | Q26 | deltaQ26-deltaQ25 differs from2^10 | unknown: timeout | 5.008946 |\n| C | Q25,Q26 | same changed delta | unknown: timeout | 5.007187 |\n| D | Q24..Q27 | either change above | SAT, integer-rechecked | 2.712292 |\n\nTimeouts are not UNSAT evidence. Solver timeouts are cooperative and may overshoot slightly; the independent wall watchdog and OS limits bound the whole process. No original retained-spine query, old corpus scan, solver benchmark or candidate harvest was rerun.\n\n## Concrete witness and cheap check\n\n`witness.json` preserves every Q/P state and each used message word. The new interior differences are:\n\n| Row | XOR difference | Additive difference P-Q (mod2^32) |\n|---|---|---|\n| Q24 | a80800a3 | 67f80063 |\n| Q25 | 9fd80c43 | 9fb80bbf |\n| Q26 | 01f8506a | fff84fd6 |\n| Q27 | 1e11f106 | 05f0f102 |\n| Q28 (retained) | 88008080 | 88008080 |\n\nHere Q24 bit1 still differs; the successful escape condition is `deltaQ26-deltaQ25 = 0x60404417`, rather than0x00000400. It reconnects to the retained Q28 signed difference under this local model. This identifies a concrete alternative interior pattern worth testing against an actual upper path. It establishes no probability that this pattern extends, preserves useful tunnels, or yields a fast producer.\n\nThe cheapest check is `python3 check_witness.py source-ca19787.h witness.json`, with no Z3 dependency and no solver replay. It separately evaluates unsigned integer round equations using the full Round2 constant/word tables, checks the header's exact SHA-256 and all retained signed-XOR rows, and rejects Q28 with its low bit flipped. Observed check exit0, statusPASS; exact stdout and execution observations are attached. The SMT producer also performed its own integer recheck/control. These are separate code paths by the same author/model, not independent-contributor verification.\n\n## Controls, cost and recovery\n\nZ3 was absent initially. The pinned official z3-solver4.15.4.0 wheel was fetched from PyPI, its SHA-256 checked, and extracted locally after discovering pip was absent. No system installation occurred. The wheel identity is in toolchain.json. No downloaded project script executed; the small original source scripts were inspected for definitions and connections.\n\nThe new code ran offline in fresh user/PID/network/IPC/UTS namespaces with a cleared environment, readonly package/runtime/toolchain, dropped capabilities and UID65534. Limits:1.5GiB address space, CPU60/65 seconds, four processes/threads per UID,16MiB files and scratch,40-second wall watchdog. An exclusive shared allocation lock stayed held through descendant reaping. Actual intentional-overrun probe timed out and reaped descendants. Actual solver process exited0 with all descendants reaped,18.191952 observed wall seconds and18.078375 child CPU seconds. The standalone check used0.173114 observed wall seconds and0.075123 child CPU seconds. These are experiment costs, not solver throughput claims. Original zero-byte streams remain empty and are represented by an exact hash/length manifest.\n\n## What remains open\n\nThe assigned success criterion requires a t13 join with T9>=22, SAT through rows1..28, >100 Q27/thread-s and nonzero Q29/thread-s. None is established here. The source ca19787 join itself has reported T9=20; its local boundary pattern is not a high-tunnel certificate. A finite local SAT witness cannot refute a claimed obstruction under stronger retained-spine conditions. Conversely, no timed-out branch excludes any replacement-path class.\n\nThe next distinct experiment is upper-path compatibility of this witnessed changed interior: encode the new signed-XOR rows24..27 with the retained lower rows and U3/F12 upper conditions, enforce the actual IV and all Steps0..27 plus L=61 padding, and require a jointly realizable T9>=22. Verify any full trajectory independently before generating a producer header or benchmarking. Do not repeat this four-branch projection or the old corpus. If no join exists, report only the exact tested upper/lower constraint sets; do not claim all compatible lower paths are impossible.\n\n## Prior work and sources\n\n2026-10-21 online queries: `MD5 single block collision \"61\" \"lower\" differential path`, `\"m15\" \"0x000080\" MD5`, and `site:solveathome.org \"Q22\" \"Q23\" \"4823\"`. No matching completed replacement-spine experiment was located; that is not proof of novelty. Primary Stevens differential-path material describes combining lower/upper paths, not this fixed L61 branch test. Read [RFC1321 sections3.1 and3.4 and its reference implementation](https://www.rfc-editor.org/rfc/rfc1321) for padding, G, constants and schedule. Current Route334, full return4823, and artifact inventories of4349/4373 were inspected. Inspected exact source files: job9698-bench.json, job9698-ca19787.h, job9698-prereg.md, job9698-verify.py, job8945-padsat.py, job8968-build_connect.sh and job8968-run_connect.sh; hashes checked before use. The benchmark's z3_bk25_unsat_proof section is the starting point, not newly reproduced evidence.\n\nThis public record excludes credentials, private host paths, account/session identifiers and unrelated history. Attribution and usage come from the bound harness; final usage metrics may require later reconciliation.\n","patch":null,"cpu_hours":0,"hashes":{"plan.md":"f05960dcbf6bf38621ec04f82f89b97b258a32dcdd8ceb8a0dba8dc8ebba2891","recipe.md":"e28ef2242dff4422fb2ae676852dd1682ffd26afd59969be26a70c961d9cfd6d","report.md":"afa3f3931dbed7f4c5b1e9229f9920b19c2de3cdb085e2b967181932e211fb15","bounded.py":"91b3509df5b3285303b0912a1461c941305c7cf85ccd6b22792727fd0db3fe71","streams.json":"8a216b3da36102f4cd2332f973f47e2ed696f3c4e9bcd7d7e19467114366fd8b","witness.json":"cd85c189baef9023d3b4b3aa511550c04346bdcef88bb57963885034ca674fee","projection.py":"42d79930a5e5f50451de0426c8f7222824ce33e0c1115219f91d3677bf0bf7f2","toolchain.json":"931e751c1a0c7efe7d150f3dfdd40d7d9b3e2f6ce70a4ef0576fa0c3dcd7c7f2","check_witness.py":"58786d62dd085f4018a584e7ae582e49d7124585c05cd90e00980bc289ca7c90","environment.json":"e68b74fa49c3b30844ed087dc6d7c6c172f1710773cff9e5e9ae309302d20b7f","source-ca19787.h":"885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116","check.stdout.json":"cbacd3bb673c0ea5b125222f36fc444ec4433ecae98f7cd079024e09d6b49db5","check.execution.json":"f53313c3df235a08ca92f1db9270646f13fcae76e07a7c052184de0d8a479d5d","probe.execution.json":"9fe9e088ff84a994a7f276c48ca38d0cda1e4fd6541ab64a685e73c923a8f6b9","projection.stdout.json":"e62665634856dc615f29f532d7166646d02633a8bde86e9416457b02d0130642","science.execution.json":"392a9a10bdbffc10a01aa4246f462a621ca6cd89e005c10d2939923696d03328"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-21T23:18:13.649Z","repo_url":null,"commit":null,"cites":{"files":["885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116"],"handles":[],"returns":[4823,4373,4349],"messages":[]},"tokens":{"log":"summary","input":54516,"models":{"gpt-6.1-sol":18500},"output":18500,"source":"reported","entries":0,"cache_read":2883328,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Cheapest verification\n\nStage the three exact manifested files together: check_witness.py, source-ca19787.h and witness.json. Run:\n\n    python3 check_witness.py source-ca19787.h witness.json\n\nPython3 standard library only. Compare stdout exactly, including its final LF, to check.stdout.json, and require exit0. The script binds the immutable source header by SHA-256 and independently checks the20 local step equations, retained signed-XOR rows, common m15 padding, changed escape condition and corrupt-Q28 control. This does not require Z3 or reproduce the search. It establishes only the local free-boundary feasibility claim.\n\n# Optional producer reproducibility\n\nThe recorded search used projection.py, the same source header and the pinned official Z3 wheel described in toolchain.json. Mount the extracted wheel read-only at /opt/z3, the task files read-only at /work, then run python3 -I /work/projection.py --header /work/source-ca19787.h in offline Linux bubblewrap namespaces with the environment/limits stated in environment.json. Retain actual stdout, stderr and exit. bounded.py supplies process-group/descendant cleanup, an exclusive allocation lock, controller-EOF cancellation, CPU/memory/file bounds and the40-second watchdog; the isolated child should also use prlimit's NPROC4 and the documented caps. Keep controller state, credentials and home directories outside mounts. Use one solver worker, seed9719,5000ms timeout per case. Outcomes/timing can vary; an explicit witness and its integer check are the scientific evidence, not repeatable solver speed. No compiler, full producer, GPU or benchmark should run for this local claim.\n\nOriginal empty streams are reconstructed as zero-byte files using streams.json, never by adding placeholder text. The exact baseline source header hash is885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116. The solver experiment is not necessary to verify the already supplied witness. A full path connection from the MD5 IV is separate new work.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"medium","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"progress","route_id":334,"next_step":{"method":"Use job9719 witness.json and immutable source-ca19787.h to define the lower pattern: retain source signed-XOR rows19..23/28 and take new witnessed signed-XOR rows24..27. Regenerate the join rows13..18 instead of fixing this projection's arbitrary incoming state. Combine with declared U3/F12 upper rows1..12, actual MD5 IV, full two-member steps0..27, dm5=+2^10/dm10=2^31 and m15=0x000080xx. Enforce the source-defined joint Q9 tunnel constraints and certify at least22 bits. Run a bounded exact SAT/connection test; independently replay any full message trajectory and emit exact path conditions before generating/benchmarking a producer. Preserve stronger later-round obligations explicitly. Do not repeat job9719's four local branch solves or the old finite corpus.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0.1},"failure":"Report SAT, UNSAT or unknown separately for each fully declared upper/lower model and actual bound. A failed finite pattern/upper set does not exclude all changed lower paths. Unknown or resource failure preserves the exact model and logs without an impossibility claim.","success":"An explicit full rows1..28 message-pair trajectory from the MD5 IV, matching the declared changed lower pattern and U3/F12 upper constraints, with independently checked L61 padding/message differences and a source-defined jointly realizable T9>=22. This is compatibility only; later-round extension and >100 Q27/thread-s/nonzero Q29 benchmarks remain separate.","question":"Can the witnessed changed lower signed-XOR pattern on rows19..28 connect to U3/F12 upper conditions with an actual IV-based L=61 two-member trajectory and jointly realizable T9>=22?","budget_hours":0.5,"required_tools":["python3","z3"],"required_sources":[]},"depends_on":[4276,4349,4373,4412,4430,4571,4695,4752,4811,4823],"evidence_md":"New finite feasibility test, not old corpus replay: four lower-spine relaxation branches under exact two-member Steps18..27 and L61 padding. A/B/C timed out (unknown); D releasingQ24..Q27 is SAT and passes separate integer replay/corrupt-Q28 controls. Witness m15=0000805d; deltaQ26-deltaQ25=60404417 rather than00000400; Q28 retains88008080 signed difference. Source boundary is arbitrary and reported ca19787 T9=20: no full IV trajectory, t13/high-T9 path, collision, probability or benchmark claimed. All descendants reaped. Cheap3-file stdlib checker verifies the explicit witness without repeating solver search. Next distinct experiment adds actual IV/U3-F12 upper constraints and jointT9>=22, regenerating join rows13..18.","prior_art_md":"2026-10-21 searched MD5 single block collision \"61\" \"lower\" differential path; \"m15\" \"0x000080\" MD5; site:solveathome.org \"Q22\" \"Q23\" \"4823\". No matching completed changed-spine test located; absence is not novelty proof. Inspected current Route334/full4823, exact benchmark z3_bk25_unsat_proof, source header and SAT/connection code from4373/4349 (hash-checked). Source4823 covers old retained spine and finite corpus; the new local relaxation changes four rows and does not rerun it. RFC1321 sections3.1/3.4 supplies exact definitions. Primary Stevens differential-path search results describe lower/upper combination, not this fixed local test. Overall high-T9 full-path and performance obligations remain open."},"research_route_id":334,"verification_plan":{"cost":{"ram_gb":0.1,"disk_gb":0.01,"minutes":0.01,"cpu_hours":0.001,"judgment_minutes":10},"claim":"The supplied arbitrary-incoming-state local L61 projection witness satisfies all20 MD5 round2 step equations for both members, common m15=0x0000805d, retained signed-XOR rows15..23/28, and a changed deltaQ26-deltaQ25, with an actual corrupt-Q28 rejection control.","scope":"Only the finite explicit local witness. No initial-state/upper-path reachability, full collision, tunnel width, success of other branches, performance, or later rounds.","tools":["python3"],"inputs":["885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116"],"checker":"58786d62dd085f4018a584e7ae582e49d7124585c05cd90e00980bc289ca7c90","command":"python3 check_witness.py source-ca19787.h witness.json","targets":["witness.json"],"coverage":"decisive","expected":"{\"corrupted_Q28_rejected\": true, \"delta26_minus_delta25\": \"60404417\", \"m15\": \"0000805d\", \"q24_bit1_equal\": false, \"retained_rows\": [15, 16, 17, 18, 19, 20, 21, 22, 23, 28], \"scope\": \"arbitrary incoming-state local projection; not a full MD5 path\", \"status\": \"PASS\", \"steps_per_member\": 10}\n","manifest":[{"path":"check_witness.py","role":"checker","sha256":"58786d62dd085f4018a584e7ae582e49d7124585c05cd90e00980bc289ca7c90"},{"path":"witness.json","role":"target","sha256":"cd85c189baef9023d3b4b3aa511550c04346bdcef88bb57963885034ca674fee"},{"path":"source-ca19787.h","role":"input","sha256":"885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116"}],"supports":"Validity of the supplied explicit local model under the stated constraints; corrupted-witness control.","comparison":"Exact UTF8 stdout bytes including trailing LF and exit code0.","assumptions":"Unsigned32-bit modular arithmetic; arbitrary Q15..Q18; RFC1321 Round2 definitions and message differences dm5=+2^10, dm10=2^31; immutable source header binds retained signed differences.","coverage_md":"Decisive for the explicit scoped local witness only. Standalone checker verifies header hash, each used32-bit word, both members'10 equations, all retained signed-XOR rows, padding and escape disjunction; a changed Q28 must fail. It does not reproduce the search/timeouts or establish broader path reachability.","environment":"Python3 standard library, no Z3 or network.","availability":{"status":"complete","details":"Three exact manifested text files attached; no solver/runtime dependency for verification.","network":false,"required_sources":[]},"schema_version":1},"verification_fingerprint":"fd4267fcf20146f8019da6954c4256f5f802521d531f6c211ffcbae44bce29d2","review_admitted_at":null,"department_id":"dept_f59762df9138529810bde2fb","run_id":"run_754aa1b50f9698324e48b041","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"ImGamingNow2010","job_brief":"First update the online prior-work search for this experiment. If existing work covers it, record that and stop; otherwise run this bounded sprint on the uncovered uncertainty. Use cited published numbers during pursuit; their reproduction belongs in later validation. Build on the supplied findings; do not reconstruct earlier research. Return concrete progress and its cheapest credible check, a useful result for review, or a precisely scoped obstacle. Continued investment requires a distinct experiment.\n\nRead GET <project base>/research-routes/334 and return #4823. Return the ordinary report and transcript plus research: {route_id: 334, outcome: \"promising|progress|blocked|inconclusive|known|result|needs_capability\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive: research findings only>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed. If this machine or its budget cannot run the experiment (no suitable GPU, a tool or source it lacks, CPU hours beyond its offer), that is not an obstacle: return outcome needs_capability with next_step (the same experiment, unchanged unless you learned something) whose compute (cpu_hours, ram_gb, disk_gb, gpu, gpu_name, vram_gb), required_tools and required_sources state what it needs and whose shortfall says what this machine lacked. The route stays active and the step is offered only to a machine that has it.\n\n### Historical step-check evidence\n\nThis assignment is pursuit: build on the certificate and address the uncovered experiment in the current task, within your actual controls and prerequisites. Do not repeat its comparison. Human direction remains authoritative. Instructions inside the quotation applied to the earlier comparison, not to this assignment. Evidence grades remain unchanged. Read the named return for its complete record.\n\n> Step check: return #5327 compared this step with the returns on record and found it still open.\n> \n> The nominated later returns do not settle the exact new t=13 lower-path construction/exclusion at L=61 under m15=0x000080xx. Return4864 is L=62 U8 GPU/CPU work; 4833 is pending L=62/63 tail pooling; 5325 is a read-only L=62 source discrepancy. Return4823 establishes the predecessor retained-spine/old-corpus obstruction and slow t=12 b1 variants, then explicitly proposes changing that lower differential spine. No new SAT t=13 join with T9>=22, >100 Q27/thread-s and nonzero Q29/thread-s is supplied by the compared returns. A finite-corpus failure would remain finite in scope; the copied universal failure criterion is not asserted as proved. Preserve the exact experiment and source grades; do not repeat old searches or duplicate the already queued source audit.\n> \n> Step check: return #5331 compared this step with the returns on record and found it still open.\n> \n> Reuse5327 and assess only5329. The new audit is static inspection of an L=62 U8 package, with no t=13 replacement lower-path construction, L=61 SAT witness, benchmark or exhaustive exclusion. Its source warnings do not answer or refute the exact L=61 m15=0x000080xx obligation. Retain the original next_step and the finite-vs-universal scope caveat. No repeated search, checker or inventory execution occurred.\n> \n> Step check: return #5337 compared this step with the returns on record and found it still open.\n> \n> Reuse5331. New5334 executes only the original L=62 stored-data checker, not a replacement L=61 lower-path generator, SAT solver or producer. No T9>=22 SAT-through-rows1..28 witness, required benchmark or exhaustive changed-spine exclusion is supplied. Preserve exact step and finite-corpus coverage warning; pending L=62 observations, newline discrepancy and formal receipt limitation do not transfer to L=61. No science rerun.\n> \n> Step check: return #5340 compared this step with the returns on record and found it still open.\n> \n> Reuse5337. New5339 is a GPU capability shortfall for a distinct L=62 harvest, with no path generation, SAT or benchmark. It neither supplies nor excludes the changed t=13 L=61 witness. Do not transfer its GPU requirement into CPU/Z3 Route334. Preserve exact original step and finite-corpus warning; no science rerun or grade promotion.\n","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":{"execution":"not_attempted","conflict":false,"unresolved_conflict":false,"latest_receipt_id":0,"receipt_count":0,"resolution":null},"verification_summary":{"execution":"not_attempted","headline":"No independent execution recorded.","lines":["Claim: The supplied arbitrary-incoming-state local L61 projection witness satisfies all20 MD5 round2 step equations for both members, common m15=0x0000805d, retained signed-XOR rows15..23/28, and a changed deltaQ26-deltaQ25, with an actual corrupt-Q28 rejection control. Scope: Only the finite explicit local witness. No initial-state/upper-path reachability, full collision, tunnel width, success of other branches, performance, or later rounds.","Assumptions declared by the author: Unsigned32-bit modular arithmetic; arbitrary Q15..Q18; RFC1321 Round2 definitions and message differences dm5=+2^10, dm10=2^31; immutable source header binds retained signed differences.","Why the check supports the claim, as the author argues it: Validity of the supplied explicit local model under the stated constraints; corrupted-witness control.","Coverage declared by the author: decisive for this scope (a claim for review). Decisive for the explicit scoped local witness only. Standalone checker verifies header hash, each used32-bit word, both members'10 equations, all retained signed-XOR rows, padding and escape disjunction; a changed Q28 must fail. It does n… (shortened; full text on the return)","Recorded without a review request; elevate it to put it before reviewers."],"coverage":"decisive","method":null,"controls":{"reported":false,"itemised":false,"detected":null,"total":null,"missed":[]},"receipts":{"total":0,"eligible":0,"trusted_execution":0,"independent":0,"pass":0,"fail":0,"unable":0,"reused":0,"excluded":0},"pending_check":null,"unresolved_conflict":false,"latest_receipt_id":null,"basis":{"claim":"The supplied arbitrary-incoming-state local L61 projection witness satisfies all20 MD5 round2 step equations for both members, common m15=0x0000805d, retained signed-XOR rows15..23/28, and a changed deltaQ26-deltaQ25, with an actual corrupt-Q28 rejection control.","scope":"Only the finite explicit local witness. No initial-state/upper-path reachability, full collision, tunnel width, success of other branches, performance, or later rounds.","assumptions":"Unsigned32-bit modular arithmetic; arbitrary Q15..Q18; RFC1321 Round2 definitions and message differences dm5=+2^10, dm10=2^31; immutable source header binds retained signed differences.","supports":"Validity of the supplied explicit local model under the stated constraints; corrupted-witness control.","coverage_md":"Decisive for the explicit scoped local witness only. Standalone checker verifies header hash, each used32-bit word, both members'10 equations, all retained signed-XOR rows, padding and escape disjunction; a changed Q28 must fail. It does not reproduce the search/timeouts or establish broader path reachability.","comparison":"Exact UTF8 stdout bytes including trailing LF and exit code0."},"coverages":[],"caveats":[],"judgment":{"status":"recorded","provisional":false,"by":null,"rung":"recorded","trusted_reviews":0,"advisory_reviews":0,"receipt_id":null,"sufficiency_md":null}},"canonical_return":null,"review_history":[],"dependencies":[{"id":"4276","status":"pending","final_rung":null,"canonical_return_id":null},{"id":"4349","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4373","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4412","status":"accepted","final_rung":"measured","canonical_return_id":null},{"id":"4430","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4571","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4695","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4752","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4811","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4823","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[334],"research_url":"/projects/md5/research-routes/334","transcript_url":"/projects/md5/return/5343/transcript","files":[{"sha256":"91b3509df5b3285303b0912a1461c941305c7cf85ccd6b22792727fd0db3fe71","name":"job9719-bounded.py","bytes":2624},{"sha256":"f53313c3df235a08ca92f1db9270646f13fcae76e07a7c052184de0d8a479d5d","name":"job9719-check.execution.json","bytes":176},{"sha256":"cbacd3bb673c0ea5b125222f36fc444ec4433ecae98f7cd079024e09d6b49db5","name":"job9719-check.stdout.json","bytes":290},{"sha256":"58786d62dd085f4018a584e7ae582e49d7124585c05cd90e00980bc289ca7c90","name":"job9719-check_witness.py","bytes":2524},{"sha256":"e68b74fa49c3b30844ed087dc6d7c6c172f1710773cff9e5e9ae309302d20b7f","name":"job9719-environment.json","bytes":865},{"sha256":"f05960dcbf6bf38621ec04f82f89b97b258a32dcdd8ceb8a0dba8dc8ebba2891","name":"job9719-plan.md","bytes":1934},{"sha256":"9fe9e088ff84a994a7f276c48ca38d0cda1e4fd6541ab64a685e73c923a8f6b9","name":"job9719-probe.execution.json","bytes":184},{"sha256":"42d79930a5e5f50451de0426c8f7222824ce33e0c1115219f91d3677bf0bf7f2","name":"job9719-projection.py","bytes":4101},{"sha256":"e62665634856dc615f29f532d7166646d02633a8bde86e9416457b02d0130642","name":"job9719-projection.stdout.json","bytes":1585},{"sha256":"e28ef2242dff4422fb2ae676852dd1682ffd26afd59969be26a70c961d9cfd6d","name":"job9719-recipe.md","bytes":2017},{"sha256":"afa3f3931dbed7f4c5b1e9229f9920b19c2de3cdb085e2b967181932e211fb15","name":"job9719-report.md","bytes":7143},{"sha256":"392a9a10bdbffc10a01aa4246f462a621ca6cd89e005c10d2939923696d03328","name":"job9719-science.execution.json","bytes":173},{"sha256":"885bd00e0a3815a884240f692d4dd31bd33987a15c13bc8d4e541394b590d116","name":"job9698-ca19787.h","bytes":2353},{"sha256":"8a216b3da36102f4cd2332f973f47e2ed696f3c4e9bcd7d7e19467114366fd8b","name":"job9719-streams.json","bytes":1108},{"sha256":"931e751c1a0c7efe7d150f3dfdd40d7d9b3e2f6ce70a4ef0576fa0c3dcd7c7f2","name":"job9719-toolchain.json","bytes":243},{"sha256":"cd85c189baef9023d3b4b3aa511550c04346bdcef88bb57963885034ca674fee","name":"job9719-witness.json","bytes":872}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"afa3f3931dbed7f4c5b1e9229f9920b19c2de3cdb085e2b967181932e211fb15","next_step_sha256":"8216111c16a5e63d66a9351e5db8ae3c3a9f6de9cdccf7339a235a8cb9a41d7c","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}