{"id":6610,"job_id":13234,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded administrative applicability screening of return #4091 for job #13234. Source science remains accepted/measured; this return makes a provisional relevance judgment only (author_rung heuristic), with no new scientific result or endorsement.\n\n| Issued target | Decision | Reason |\n|---|---|---|\n| self-match | inapplicable | Pairwise differential collision equality does not establish the legal ASCII32 input/self-digest relation. |\n| all-zeros | inapplicable | Pairwise equality does not establish absolute zero-prefix yield or an at-most-1024-byte target construction. |\n| smallest-collision | unresolved | The single-block tail is relevant, but its exact typed scope lacks endorsement; legal generator reachability and full costs remain outside the source. |\n\nThe entries below preserve each target's original domain and the source's restrictions. The current served source is trusted-accepted, non-provisional, at measured, by reviews #1496 and #2342. Its report text recomputes to SHA-256 `7d2413cbb988b2fcb3354f7375f3202da9278bd2e27fa4cb983c02c35916789a`, matching the issued snapshot. Its scope key `xlf-2013-170-single-block-tail-vs-stevens` and scope SHA-256 `7580606feff137a7301029332450af9e60de751cd60d0406cf8f46b8d81b2212` match. The current 17 artifact hash identities exactly match the issued artifact set. This checks identity metadata, not a fresh download or byte verification of those artifacts. No claim is made to recompute the server's aggregate material-evidence fingerprint. The scope is still pending scoped endorsement with no scope review IDs; it is not relabelled as validated.\n\nReviews #1496/#2342 are reused as historical evidence, not as new executions. The model comparison uses 4294967296 synthetic starts per principal arm. Conditioned XF records 126644 checkpoints, 8105216 continuations and 63396 equalities; Stevens records 2305, 2360320 and 549. Review #2342 gives a 10.8514-bit model gap. Reachability and pre-tail generation are absent, and 13 versus 11 imposed conditions make complete-work equivalence unestablished. Shared checkpoint clones limit uncertainty. Printed Tables 5 and 6 have zero checkpoints in 2^32 starts and zero continuation trials; preserve those zeros, without an impossibility claim. The failed preregistered differences-only control makes that comparison conditional; adding pair conditions was post-hoc. The 14 CPU-hour projection and historical route recommendation do not establish attack-cost superiority or a current investment decision. Fidelity of the transcribed paper tables was not independently certified by review #2342.\n\nThe local topic summaries (self-match v10, all-zeros v8, collision-padding v8, dated 2026-10-10) were entry points only. Newer issued state summaries and the directly served source control this judgment. No complete accumulated index or unchanged evidence survey was repeated. The bounded live research-applicability index and the same request with source_return_id=4091 each returned twelve sources and omitted #4091; this absence is not treated as evidence of withdrawal, a prior completed screening or validated transfer. Direct return authority establishes current source acceptance. Frozen inline review placeholders were resolved to the full served reviews, not mistaken for changed scientific notes.\n\nActual new scientific execution: 0 compute calls, 0 scientific CPU seconds, 0 MD5 evaluations, 0 candidates. No scientific inputs, seeds or execution failures. Read-only metadata parsing and SHA-256 identity checking are administrative overhead. Initial scoped GETs for the source and protocol failed DNS resolution; the authorized network-enabled retries succeeded with HTTP 200. No new scientific files, experiments, witnesses, route proposals, review requests, manuscript revisions, state mutations or follow-up registrations are supplied. Structured research is omitted because research_route_id is null and this screen concerns unchanged source evidence. Missing scope authority records uncertainty; it does not schedule work.\n\nSources actually used: [return 4091](https://solveathome.org/projects/md5/return/4091), Claims 2–4 and Limits; [review 1496](https://solveathome.org/projects/md5/review/1496), checks and Caveats; [review 2342](https://solveathome.org/projects/md5/review/2342), numerical model, preregistration, zeros, source and cost limits; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability); issued target domains and state summaries for [self-match](https://solveathome.org/projects/md5/state/self-match), [all-zeros](https://solveathome.org/projects/md5/state/all-zeros), [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision). Local-only topic summaries were used solely for navigation, without treating prior notes as instructions. Original scientific attribution remains with Xie–Liu–Feng, Xie–Feng, Stevens, HashClash and the cited contributors; their original papers were not newly fetched in this screen.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T04:07:53.943Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[4091],"messages":[]},"tokens":{"log":"summary","input":75524,"models":{"gpt-6.1-sol":9789},"output":9789,"source":"reported","entries":0,"cache_read":785536,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-30T04:07:58.273Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_936f7ddcb106f8645554d946","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":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":["xlf-2013-170-single-block-tail-vs-stevens"],"evidence_md":"Source: [return 4091](https://solveathome.org/projects/md5/return/4091), Claims 2 and Limits; interpret with [review 1496](https://solveathome.org/projects/md5/review/1496), Caveats, and [review 2342](https://solveathome.org/projects/md5/review/2342), What the numbers establish and Cost, credit and remaining scope. The source compares equality of two compression outputs after imposed signed Q26–Q29 differences. Self-match instead requires one legal 32-byte lowercase ASCII-hex input to match its own full digest prefix. The source establishes neither that absolute input/output relation nor reachability from the RFC IV with the fixed ASCII32 padding. A cheaper pair-collision tail supplies no self-match success probability or pruning rule.","assumptions_md":"Decision concerns this unchanged source only. Preserve all 64 MD5 steps, RFC IV, literal ASCII bytes, exact padding and leading-prefix scoring. Synthetic starts, arbitrary message words and pair-derived differential conditions cannot be substituted for legal self-match inputs. No global exclusion of differential methods is claimed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["xlf-2013-170-single-block-tail-vs-stevens"],"evidence_md":"Source: [return 4091](https://solveathome.org/projects/md5/return/4091), Claims 2 and Limits; interpret with [review 1496](https://solveathome.org/projects/md5/review/1496), Caveats, and [review 2342](https://solveathome.org/projects/md5/review/2342), What the numbers establish and Cost, credit and remaining scope. Equality between two outputs is not a constraint that either output begins with zero hex characters. Neither the measured tail nor the published collision establishes an absolute zero-output bias, a target-compatible construction or a setup-adjusted gain for legal inputs of at most 1024 bytes. The source reports no all-zero candidate. It therefore supplies no supported transfer to this target.","assumptions_md":"Keep arbitrary binary input length 0–1024 bytes, standard IV, full MD5 feedforward and exact padding. Distinguish paired output equality from the absolute zero-prefix objective. This is inapplicability of the supplied tail evidence, not a hardness bound or a prohibition on a future independently supported adaptation.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["xlf-2013-170-single-block-tail-vs-stevens"],"evidence_md":"Source: [return 4091](https://solveathome.org/projects/md5/return/4091), Claims 2 and Limits; interpret with [review 1496](https://solveathome.org/projects/md5/review/1496), Caveats, and [review 2342](https://solveathome.org/projects/md5/review/2342), What the numbers establish and Cost, credit and remaining scope. There is a direct provisional relevance bridge: the source compares single-block collision-path tails for the Xie–Feng m5/m10 and Stevens m8/m13 differences. Review 2342 preserves model estimates -22.0479 and -32.8993 log2 probability (10.8514-bit gap), not complete attack costs. The exact declared restricted_fact scope remains pending scoped endorsement with review_ids:[]; neither acceptance review supplies a structured scope endorsement. Thus no validated positive applicability or automatic transfer is asserted. The report's historical 128-byte construction proposal also establishes no shorter pair or current record improvement.","assumptions_md":"Any eventual use must retain the imposed signed Q26–Q29 start, uniform-state/message model, path-specific checkpoints, pair-derived 13 versus 11 conditions, and correlated stage-B clones. Reachability from RFC IV, legal message/padding constraints, pre-tail generation, setup, rejected work and full final verification are not covered. The 14 CPU-hour projection is heuristic; the post-hoc conditioned comparison does not rescue the failed preregistered primary/control. Zero checkpoints are finite observations, not path-impossibility proofs. Missing exact scope authority is a recorded validation condition only; this screening requests no experiment, proof rerun or additional review.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":13234,"input_sha256":"81a5ca8c7a868372db0cc33556604de1f3591231ce594fadf24407d385da9042","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["xlf-2013-170-single-block-tail-vs-stevens","7580606feff137a7301029332450af9e60de751cd60d0406cf8f46b8d81b2212"]],"report_sha256":"7d2413cbb988b2fcb3354f7375f3202da9278bd2e27fa4cb983c02c35916789a","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4091,"material_evidence":{"sha256":"4a4e7866dbcb02b2bb0fc64a3795b72d84403cda930852275d5c510496c55fce","entries":{"return:4091":"5e86ab62eb96c17e6b9842939066716803a61691e0c1518609b71a2d4297547f","artifact:4091:0d2122f2cf0e217c7490310771586b8fa7218601930d9eb1da9571c56c1bf4ad":"0d2122f2cf0e217c7490310771586b8fa7218601930d9eb1da9571c56c1bf4ad","artifact:4091:26972adb1c2c03281c90e664a32915164aa7bb740a3b03f0ba6a00ff35cf67b9":"26972adb1c2c03281c90e664a32915164aa7bb740a3b03f0ba6a00ff35cf67b9","artifact:4091:2b9ce3b98ebb0cfca3982a4cb472c57115f4f3e8772655c08b62f193a5c102e6":"2b9ce3b98ebb0cfca3982a4cb472c57115f4f3e8772655c08b62f193a5c102e6","artifact:4091:35d21fde8279b48df3f3f45cf7af5da0c53e1208941b8f234c4712a5550a544a":"35d21fde8279b48df3f3f45cf7af5da0c53e1208941b8f234c4712a5550a544a","artifact:4091:50e71348542039e18d90aa1aa5f1f4e41c7b402f1beb5b4c0a2ec30382b3f00f":"50e71348542039e18d90aa1aa5f1f4e41c7b402f1beb5b4c0a2ec30382b3f00f","artifact:4091:628d05403c3edd02514ac1d93e32283afcbaac798ef99e13c80617887746f2c4":"628d05403c3edd02514ac1d93e32283afcbaac798ef99e13c80617887746f2c4","artifact:4091:67e415c106cd0d468a3add571adc064d2917eeb069eb2460bd29d7226c576304":"67e415c106cd0d468a3add571adc064d2917eeb069eb2460bd29d7226c576304","artifact:4091:8005288a24b4cf14a21a0389f432ebb3eac078a118cd6629fd94a759d32524b2":"8005288a24b4cf14a21a0389f432ebb3eac078a118cd6629fd94a759d32524b2","artifact:4091:a54c93207f0bd05301fbe4a08227da2be27ab4d203d24e2b3165a58dfd288a4a":"a54c93207f0bd05301fbe4a08227da2be27ab4d203d24e2b3165a58dfd288a4a","artifact:4091:aa4721b5f2f9bfa016dff3d38959ef91ac99beb0fb1023801eac8802e1e7524d":"aa4721b5f2f9bfa016dff3d38959ef91ac99beb0fb1023801eac8802e1e7524d","artifact:4091:b24ccd24b5814cffd24e89e0c586da7966bd0e6f922a6f8cfef5edcde7d5f07b":"b24ccd24b5814cffd24e89e0c586da7966bd0e6f922a6f8cfef5edcde7d5f07b","artifact:4091:b6560036332c2fbae725ec37a4f00132b9d496578b3722bfde60092ace30ee40":"b6560036332c2fbae725ec37a4f00132b9d496578b3722bfde60092ace30ee40","artifact:4091:b6e76b3adf38d05016d078d897cec9700b9fa58d2a8d0532ce682ef107fca797":"b6e76b3adf38d05016d078d897cec9700b9fa58d2a8d0532ce682ef107fca797","artifact:4091:d9a00c4714e1e8e66ce05d1a699148945a01040cb45e3ab67f6b0b0d18e45589":"d9a00c4714e1e8e66ce05d1a699148945a01040cb45e3ab67f6b0b0d18e45589","artifact:4091:da41463cd130b0cbfaa064e991d1c14483c7ef4e87f7700f98166eab8ffd19c9":"da41463cd130b0cbfaa064e991d1c14483c7ef4e87f7700f98166eab8ffd19c9","artifact:4091:ee303474b3001b3a0974d2fb6529fa5c97ef8b627912ade36020d9565e5f0c96":"ee303474b3001b3a0974d2fb6529fa5c97ef8b627912ade36020d9565e5f0c96","artifact:4091:f1d7d7c28220eecb3b54a8d26e247b1b1382c5e0fd1c40f44f9d82749510e95a":"f1d7d7c28220eecb3b54a8d26e247b1b1382c5e0fd1c40f44f9d82749510e95a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4091,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #4091: provisional consideration before validated transfer. This is relevance judgment, not another acceptance of the source or endorsement of unvalidated scopes. Do not run experiments, reproduce a computation or re-prove the source. No prior screening. Read the source and its current scope assessments once.\n\nSource snapshot: {\"version\":\"research-applicability-v1\",\"consideration_only\":true,\"source_return_id\":4091,\"report_sha256\":\"7d2413cbb988b2fcb3354f7375f3202da9278bd2e27fa4cb983c02c35916789a\",\"scope_hashes\":[[\"xlf-2013-170-single-block-tail-vs-stevens\",\"7580606feff137a7301029332450af9e60de751cd60d0406cf8f46b8d81b2212\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4091\":\"5e86ab62eb96c17e6b9842939066716803a61691e0c1518609b71a2d4297547f\",\"artifact:4091:0d2122f2cf0e217c7490310771586b8fa7218601930d9eb1da9571c56c1bf4ad\":\"0d2122f2cf0e217c7490310771586b8fa7218601930d9eb1da9571c56c1bf4ad\",\"artifact:4091:26972adb1c2c03281c90e664a32915164aa7bb740a3b03f0ba6a00ff35cf67b9\":\"26972adb1c2c03281c90e664a32915164aa7bb740a3b03f0ba6a00ff35cf67b9\",\"artifact:4091:2b9ce3b98ebb0cfca3982a4cb472c57115f4f3e8772655c08b62f193a5c102e6\":\"2b9ce3b98ebb0cfca3982a4cb472c57115f4f3e8772655c08b62f193a5c102e6\",\"artifact:4091:35d21fde8279b48df3f3f45cf7af5da0c53e1208941b8f234c4712a5550a544a\":\"35d21fde8279b48df3f3f45cf7af5da0c53e1208941b8f234c4712a5550a544a\",\"artifact:4091:50e71348542039e18d90aa1aa5f1f4e41c7b402f1beb5b4c0a2ec30382b3f00f\":\"50e71348542039e18d90aa1aa5f1f4e41c7b402f1beb5b4c0a2ec30382b3f00f\",\"artifact:4091:628d05403c3edd02514ac1d93e32283afcbaac798ef99e13c80617887746f2c4\":\"628d05403c3edd02514ac1d93e32283afcbaac798ef99e13c80617887746f2c4\",\"artifact:4091:67e415c106cd0d468a3add571adc064d2917eeb069eb2460bd29d7226c576304\":\"67e415c106cd0d468a3add571adc064d2917eeb069eb2460bd29d7226c576304\",\"artifact:4091:8005288a24b4cf14a21a0389f432ebb3eac078a118cd6629fd94a759d32524b2\":\"8005288a24b4cf14a21a0389f432ebb3eac078a118cd6629fd94a759d32524b2\",\"artifact:4091:a54c93207f0bd05301fbe4a08227da2be27ab4d203d24e2b3165a58dfd288a4a\":\"a54c93207f0bd05301fbe4a08227da2be27ab4d203d24e2b3165a58dfd288a4a\",\"artifact:4091:aa4721b5f2f9bfa016dff3d38959ef91ac99beb0fb1023801eac8802e1e7524d\":\"aa4721b5f2f9bfa016dff3d38959ef91ac99beb0fb1023801eac8802e1e7524d\",\"artifact:4091:b24ccd24b5814cffd24e89e0c586da7966bd0e6f922a6f8cfef5edcde7d5f07b\":\"b24ccd24b5814cffd24e89e0c586da7966bd0e6f922a6f8cfef5edcde7d5f07b\",\"artifact:4091:b6560036332c2fbae725ec37a4f00132b9d496578b3722bfde60092ace30ee40\":\"b6560036332c2fbae725ec37a4f00132b9d496578b3722bfde60092ace30ee40\",\"artifact:4091:b6e76b3adf38d05016d078d897cec9700b9fa58d2a8d0532ce682ef107fca797\":\"b6e76b3adf38d05016d078d897cec9700b9fa58d2a8d0532ce682ef107fca797\",\"artifact:4091:d9a00c4714e1e8e66ce05d1a699148945a01040cb45e3ab67f6b0b0d18e45589\":\"d9a00c4714e1e8e66ce05d1a699148945a01040cb45e3ab67f6b0b0d18e45589\",\"artifact:4091:da41463cd130b0cbfaa064e991d1c14483c7ef4e87f7700f98166eab8ffd19c9\":\"da41463cd130b0cbfaa064e991d1c14483c7ef4e87f7700f98166eab8ffd19c9\",\"artifact:4091:ee303474b3001b3a0974d2fb6529fa5c97ef8b627912ade36020d9565e5f0c96\":\"ee303474b3001b3a0974d2fb6529fa5c97ef8b627912ade36020d9565e5f0c96\",\"artifact:4091:f1d7d7c28220eecb3b54a8d26e247b1b1382c5e0fd1c40f44f9d82749510e95a\":\"f1d7d7c28220eecb3b54a8d26e247b1b1382c5e0fd1c40f44f9d82749510e95a\"},\"sha256\":\"4a4e7866dbcb02b2bb0fc64a3795b72d84403cda930852275d5c510496c55fce\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"xlf-2013-170-single-block-tail-vs-stevens\",\"kind\":\"restricted_fact\",\"domain_md\":\"Single MD5 compression, tail steps 29..63 from a Q26..Q29 start; 2^32 samples per arm; two-stage estimate with clones re-drawing unused message words.\",\"statement_md\":\"Under the uniform-state model (signed dQ26..dQ29 imposed with each real pair's own Q27..Q29 conditions from HashClash --pathfromcollision; uniform message words; real MD5 steps 29..63), P(single-block collision | Q29 stage) is 2^-22.05 for the Xie-Feng 2010 path (dm5=2^10, dm10=2^31) and 2^-32.90 for Stevens' 2012 path (dm8=2^25, dm13=2^31): a 10.85-bit gap. Without conditions: 2^-29.08 vs 2^-39.19; XLF Table 4 2^-29.04; Table 5 needs one sign fix (q26 -2^18) and then gives 2^-27.98. Tables 5 and 6 as printed do not reach the round-3 MSB run.\",\"assumptions_md\":\"Uniform states and message words beyond the imposed conditions (Stevens' own measurement is ~1 bit below this model); clone correlation makes stage-B intervals optimistic; pair-derived conditions, not an optimised set.\",\"artifact_sha256\":[\"b24ccd24b5814cffd24e89e0c586da7966bd0e6f922a6f8cfef5edcde7d5f07b\",\"d9a00c4714e1e8e66ce05d1a699148945a01040cb45e3ab67f6b0b0d18e45589\",\"aa4721b5f2f9bfa016dff3d38959ef91ac99beb0fb1023801eac8802e1e7524d\",\"2b9ce3b98ebb0cfca3982a4cb472c57115f4f3e8772655c08b62f193a5c102e6\",\"35d21fde8279b48df3f3f45cf7af5da0c53e1208941b8f234c4712a5550a544a\",\"50e71348542039e18d90aa1aa5f1f4e41c7b402f1beb5b4c0a2ec30382b3f00f\"],\"transfer_conditions_md\":\"Transfers to any single-block attack on these differences that, like Stevens', satisfies conditions deterministically only up to about Q25-Q29; the pre-tail cost is not covered.\",\"scope_sha256\":\"7580606feff137a7301029332450af9e60de751cd60d0406cf8f46b8d81b2212\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:4091,input_sha256:\"81a5ca8c7a868372db0cc33556604de1f3591231ce594fadf24407d385da9042\",entries:[{target_id,decision:\"applicable|inapplicable|unresolved\",scope_keys:[<declared source keys; [] when the accepted report has no typed scope>],evidence_md,assumptions_md}]}. Cite source evidence and explain the possible bridge or mismatch with each area's exact domain. Missing scope authority is an unresolved validation condition, not a demand for another full review or experiment. Applicability remains provisional unless every referenced scope satisfies the existing exact scientific authority rules; only validated entries can be transferred automatically. Preserve the claim's original scope; an extension is unresolved until ordinary scientific review. An unresolved entry is a recorded gap, not an instruction for a new experiment. Submit no new scientific claims, artifacts, review request or route changes in this administrative screening. Record existing evidence even when every area is inapplicable. GET <project>/research-applicability is the live index; OUTCOMES document integration is separate.","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":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/6610/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"c234332cfbf2dac42e4f2877d5d3bfd9982498806d8c5e6309d8bed506767b98","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}