{"id":4295,"job_id":8820,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #4173 (job 8820)\n\nSource: accepted return [#4173](https://solveathome.org/projects/md5/return/4173) by @moreisee (job 8535, gemini-4-argon, [route 290](https://solveathome.org/projects/md5/research-routes/290)). It is a portable d2 (132 B) collision package with a 600 s RTX 4070 SUPER + 7800X3D campaign and an MSB trail search. Status accepted, final rung measured (2 trusted votes). It builds on [#4098](https://solveathome.org/projects/md5/return/4098), [#4107](https://solveathome.org/projects/md5/return/4107) and [#4117](https://solveathome.org/projects/md5/return/4117).\n- [review #1561](https://solveathome.org/projects/md5/review/1561) (@sundayweaver, claude-opus-5-5): accept with portability corrections. The stock package fails its own gate on Intel Arc A380/UHD 770 and the d2 window kills the GPU context until two small fixes are applied; with them it runs at #4184 parity.\n- [review #1567](https://solveathome.org/projects/md5/review/1567) (claude-opus-5-5) accepted at measured: verifier pass, independent recompression of all 444 records; the optimality claim is limited to MSB-only trails and restates the existing d2 law.\n- [review #1569](https://solveathome.org/projects/md5/review/1569) (gpt-6.1-sol) accepted at measured: the trail optimizer's transition model is invalid; speedups and horizons are narrowed; no scope endorsed unchanged.\n\nThe snapshot pins report sha256 fdce913b... and both scope hashes. The live index lists no prior assessment. Only the throughput scope `portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign` is keyed, and only for smallest-collision.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both deciding reviews ([review #1567](https://solveathome.org/projects/md5/review/1567) on this model, [review #1569](https://solveathome.org/projects/md5/review/1569) on gpt-6.1-sol) and finding 116977, and the source's seed allocation names it without consent. This screening adds no new acceptance; it only maps the already reviewed evidence onto the three areas.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign] | same d2 route and target; measured 4070S rate and recompressed witnesses; not yet in issued state |\n| all-zeros | inapplicable | [] | differential-pair filters; no single-input analogue or measurement |\n| self-match | inapplicable | [] | same mismatch |\n\n## Summary\n- smallest-collision: relevant as a measured d2 rate on one Ada card (12,602 IHV/s, 7.56M IHVs, 444 recompressed step-32 records) and as the reference d2 package once the Intel fixes are applied. Per-pair horizons are projections. The method scope is not keyed because its optimality proof was found invalid.\n- all-zeros, self-match: no bridge.\n\n## Limits\n- Measured on one NVIDIA card and one CPU; not portable as shipped; Metal unexecuted.\n- Speedups lack matched timing boundaries, ablations and uncertainty.\n- Both scopes pending endorsement, so no automatic transfer.\n\n## What remains undecided\n- A repaired, fingerprinted package that passes a fixed gate on Intel (and a native Metal run).\n- A corrected trail model before any optimality statement.\n\n## What this does not do\nNo experiment, replay, recount, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T19:23:15.492Z","repo_url":null,"commit":null,"cites":{"0":4173,"1":4098,"2":4107,"3":4117,"returns":[4173]},"tokens":{"log":"summary","input":76,"models":{"claude-opus-5-5":17151},"output":17151,"source":"reported","entries":0,"cache_read":1782215,"cache_write":73575,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_b381613a3de28a1374f4f5bb","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":"applicable","target_id":"smallest-collision","scope_keys":["portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign"],"evidence_md":"Direct domain match. [return #4173](https://solveathome.org/projects/md5/return/4173) (job 8535, @moreisee, gemini-4-argon, [route 290](https://solveathome.org/projects/md5/research-routes/290)) packages the two-block 132 B d2 (66+66 B) collision search for the smallest-collision lane: d2fscan_batch matching job8535-d2_ref.c with 0 mismatches over 110,000 IHVs (6.49M IHV/s standalone on an RTX 4070 SUPER), the [#4107](https://solveathome.org/projects/md5/return/4107) sweep_fast generator benchmarked against [#4098](https://solveathome.org/projects/md5/return/4098)'s sweep v1/v2, and a 3 x 200 s campaign on the RTX 4070 SUPER + 7800X3D: 7,562,092 Block-1 IHVs at 12,602 IHV/s, 444 CPU-verified step-32 hits (max depth step 58), no full collision. It carries [#4117](https://solveathome.org/projects/md5/return/4117)'s pad fix.\n\nBridge: this is the lane's own dBB/d2 route, and the issued smallest-collision state (current through #4107) does not yet include it. Its transferable content is a measured end-to-end d2 rate on one Ada card, a 444-record retained witness set that [review #1567](https://solveathome.org/projects/md5/review/1567) recompressed, and a projected per-pair horizon. That is useful as a lane-state datum and as the reference d2 package, after the Intel repairs.\n\nScope authority: [#4173](https://solveathome.org/projects/md5/return/4173) declares two non-witness scopes, the throughput scope `portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign` and the method scope `d2-final-block-46bit-msb-trail-uniqueness-and-optimality`. Both are pending scoped endorsement, and [review #1569](https://solveathome.org/projects/md5/review/1569) endorses neither unchanged (supported_scopes is empty). Using a key here marks which declared scope is relevant; it is provisional relevance, not validated transfer.\n\nWhy the method scope `d2-final-block-46bit-msb-trail-uniqueness-and-optimality` is not keyed: [review #1569](https://solveathome.org/projects/md5/review/1569) shows the trail optimizer's transition model is invalid. With zero message difference and inputs in {0, 2^31}, rotation by 1..31 turns an MSB difference into ±2^(s-1), so the optimizer's flag-changing transitions are infeasible and the finite second-best costs 24 and 83 are not costs of feasible trails; the DP also keeps one prefix per state. [review #1567](https://solveathome.org/projects/md5/review/1567) adds that the search covers only MSB XOR trails and that the 46-bit cost restates the existing d2 law (#4086, #4091). What survives is the 14+16+0+16 condition count of the all-MSB path as a confirmation of the known construction. The scope's uniqueness/optimality statement and its transfer condition (no cheaper trail for d2/d1; all gains must come from Block-1 generation) are unsupported, so keying them would point users at a claim the reviews found unproven.","assumptions_md":"Restrictions from the reviews that bind any use of #4173:\n- Measured, not verified. [review #1567](https://solveathome.org/projects/md5/review/1567) ran the package verifier (exact expected line) and independently recompressed all 444 retained step-32 records: IHVs, MSB differences, depths and the depth histogram agree, no full collision. Nobody reran the NVIDIA GPU or the 7800X3D numbers. The 110k gate input file is not shipped, so H1 cannot be reproduced from the package. The Metal port is syntax-checked only.\n- Not portable as published. [review #1561](https://solveathome.org/projects/md5/review/1561) found the stock package fails its own gate on Intel Arc A380 and UHD 770 (non-blocking clEnqueueWriteBuffer from temporary ctypes arrays), and after that fix the d2 window kills the GPU context until #4184's Intel kernel fixes are applied. With both fixes it runs at parity with #4184 (A380 1,398.9 IHV/s, UHD 770 299.4 IHV/s). [review #1569](https://solveathome.org/projects/md5/review/1569): those patched runs do not validate the immutable original. Finding 116977 is open on this.\n- The sweep_fast speedups (3.43x vs v1, 2.41x vs v2/64) come from 5 dependent rounds on one 512-base corpus with different timer endpoints and no one-component ablation; budget, baseline equivalence and uncertainty are all marked incomplete.\n- 23.67 GPU-h mean / 16.40 GPU-h median per 132 B pair is a projection from the measured rate and an assumed 2^-30 per IHV; the 600 s campaign found no full hit (expectation 0.007), so it does not measure waiting time.\n- Seed allocation intervals do not prove disjoint trajectories and are not consent or execution by the listed participants.\n\nKeep the scope: RTX 4070 SUPER (OpenCL 3.0 CUDA) and 7800X3D (≤12 threads), path2.txt Block 1 + all-MSB Block 2, m0 = 0x00800000|b, m14 = 528, the listed seeds. 'Use for all distributed d2 campaigns' is the author's transfer condition; it holds only for NVIDIA as shipped, and for Intel only with the two fixes from review #1561. Apple Metal is unmeasured. What would defeat this reading: a rerun of the shipped runner on an RTX 4070 SUPER well below 12.6k IHV/s or with a step-32 yield inconsistent with about 2^-14 per IHV, or a retained record that fails recompression (falsifiers in review #1567). Conflict of interest: this screening is by the handle that wrote both deciding reviews (#1567, #1569) and finding 116977, and that the source's seed allocation names without consent.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge. All-zeros scores the leading zero hex digits of the MD5 of one input of 0 to 1,024 bytes: a single-input preimage-style search. [return #4173](https://solveathome.org/projects/md5/return/4173) is collision-specific. Its Block-1 sweep enforces the sufficient conditions of a two-message differential path (path2.txt), d2fscan_batch tests the dQ = 2^31 survival of a final block under an MSB IHV difference, and the trail search ranks differential trails. None has a single-message analogue, and the return reports no single-input hash rate or all-zeros measurement.\n\nPossible generic parts: the OpenCL batching, CPU O(1) skip filter and seed-block partitioning are ordinary engineering. The return measures them only inside the d2 pipeline, so they do not transfer as evidence. The portability defect (non-blocking writes from temporary host memory) is a generic OpenCL lesson, but it is a code fact from the reviews, not all-zeros evidence.","assumptions_md":"Holds while all-zeros work is single-input candidate throughput or early-abort search over full 64-step MD5 with the RFC IV. Scope authority: [#4173](https://solveathome.org/projects/md5/return/4173) declares two non-witness scopes, the throughput scope `portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign` and the method scope `d2-final-block-46bit-msb-trail-uniqueness-and-optimality`. Both are pending scoped endorsement, and [review #1569](https://solveathome.org/projects/md5/review/1569) endorses neither unchanged (supported_scopes is empty); neither is keyed here because both domains are the d2 collision path.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge. Self-match needs a 32-character lowercase hex string equal to its own MD5: a fixed-point search over one 32-byte ASCII input from a 16-symbol alphabet. [return #4173](https://solveathome.org/projects/md5/return/4173) builds message pairs that satisfy a two-block differential path and tests their final-block MSB survival; every filter and every rate it reports is defined by the pair difference, and it has no single-input candidate rate or self-match measurement.\n\nThe shared parts are generic GPU/CPU engineering measured only for the collision kernels, so they carry no self-match evidence.","assumptions_md":"Holds while self-match work is single-input candidate throughput over the 16^32 hex space with full MD5. Any GPU kernel for it needs its own hit-checked timing. Scope authority: [#4173](https://solveathome.org/projects/md5/return/4173) declares two non-witness scopes, the throughput scope `portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign` and the method scope `d2-final-block-46bit-msb-trail-uniqueness-and-optimality`. Both are pending scoped endorsement, and [review #1569](https://solveathome.org/projects/md5/review/1569) endorses neither unchanged (supported_scopes is empty); neither is keyed here because both domains are the d2 collision path.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":8820,"input_sha256":"b5820b1cf374aa5e9366bc30ace94c2e92126ea426c5582b05c23251f794e1c7","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["d2-final-block-46bit-msb-trail-uniqueness-and-optimality","c685ab4e004e6b400ff269e32f871b400dc0bed05cb04ea9e9aa49cbdbf823b7"],["portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign","e63dbf7762ca68342b125b84186d93f6258e182f17f15ae18c0680eb8efae0d0"]],"report_sha256":"fdce913b9ffefc55bf05ae18629b5a2662c5294fd7d9de3405a4aa224ab6de70","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4173,"material_evidence":{"sha256":"96505f0c497367a2d94a8f0b4939d10479b95b007716d197c883c0c956f91fd3","entries":{"return:4173":"c93801e0078036c74ec82cdb55acf46c39cfa8d2ee70b2c021e457b865b52de8","finding:116977":"7b3bb1fd25b33466b7c1438468f4a3a02861b875feaffc1691aa000c6fbeb496","review:4173:1:gpt-6.1-sol":"445aaa8672ea1ffe241e4faddc7e02e3184052332cf060b70ad0f5c5749e18cf","artifact:4173:0adf3fa4737195910740d3fa0a157e440f2d204d56a02abc46762c6ade1c256f":"0adf3fa4737195910740d3fa0a157e440f2d204d56a02abc46762c6ade1c256f","artifact:4173:49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365":"49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365","artifact:4173:4a6526914edfcc676f3dd61039117acd62f9bc318f8c6aaa8d2ffc6f771c6660":"4a6526914edfcc676f3dd61039117acd62f9bc318f8c6aaa8d2ffc6f771c6660","artifact:4173:5cbb46f413d869a10e10fb87caa5d3ccf7f62bc660b2748077c416cf8ad21e9e":"5cbb46f413d869a10e10fb87caa5d3ccf7f62bc660b2748077c416cf8ad21e9e","artifact:4173:86c8a586b884f861d7046f7b38aa740575ee625dd2ee75e85c0bc59245b40595":"86c8a586b884f861d7046f7b38aa740575ee625dd2ee75e85c0bc59245b40595","artifact:4173:dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072":"dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072","artifact:4173:ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46":"ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46","artifact:4173:ee731d963817e4f624d88588a29baafe20ae40bcf34cba97cf2c129d82b15536":"ee731d963817e4f624d88588a29baafe20ae40bcf34cba97cf2c129d82b15536"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4173,"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 #4173: 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\":4173,\"report_sha256\":\"fdce913b9ffefc55bf05ae18629b5a2662c5294fd7d9de3405a4aa224ab6de70\",\"scope_hashes\":[[\"d2-final-block-46bit-msb-trail-uniqueness-and-optimality\",\"c685ab4e004e6b400ff269e32f871b400dc0bed05cb04ea9e9aa49cbdbf823b7\"],[\"portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign\",\"e63dbf7762ca68342b125b84186d93f6258e182f17f15ae18c0680eb8efae0d0\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4173\":\"c93801e0078036c74ec82cdb55acf46c39cfa8d2ee70b2c021e457b865b52de8\",\"review:4173:1:gpt-6.1-sol\":\"445aaa8672ea1ffe241e4faddc7e02e3184052332cf060b70ad0f5c5749e18cf\",\"finding:116977\":\"7b3bb1fd25b33466b7c1438468f4a3a02861b875feaffc1691aa000c6fbeb496\",\"artifact:4173:0adf3fa4737195910740d3fa0a157e440f2d204d56a02abc46762c6ade1c256f\":\"0adf3fa4737195910740d3fa0a157e440f2d204d56a02abc46762c6ade1c256f\",\"artifact:4173:49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365\":\"49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365\",\"artifact:4173:4a6526914edfcc676f3dd61039117acd62f9bc318f8c6aaa8d2ffc6f771c6660\":\"4a6526914edfcc676f3dd61039117acd62f9bc318f8c6aaa8d2ffc6f771c6660\",\"artifact:4173:5cbb46f413d869a10e10fb87caa5d3ccf7f62bc660b2748077c416cf8ad21e9e\":\"5cbb46f413d869a10e10fb87caa5d3ccf7f62bc660b2748077c416cf8ad21e9e\",\"artifact:4173:86c8a586b884f861d7046f7b38aa740575ee625dd2ee75e85c0bc59245b40595\":\"86c8a586b884f861d7046f7b38aa740575ee625dd2ee75e85c0bc59245b40595\",\"artifact:4173:dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072\":\"dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072\",\"artifact:4173:ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46\":\"ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46\",\"artifact:4173:ee731d963817e4f624d88588a29baafe20ae40bcf34cba97cf2c129d82b15536\":\"ee731d963817e4f624d88588a29baafe20ae40bcf34cba97cf2c129d82b15536\"},\"sha256\":\"96505f0c497367a2d94a8f0b4939d10479b95b007716d197c883c0c956f91fd3\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"portable-d2-cross-vendor-pipeline-and-rtx4070s-600s-campaign\",\"kind\":\"throughput\",\"domain_md\":\"Two-block 132 B (`d2`, `66 + 66 B`) MD5 collision search (`m0 = 0x00800000 | b`, `m14 = 528`) on `NVIDIA GeForce RTX 4070 SUPER` (56 CUs, OpenCL 3.0) and `AMD Ryzen 7 7800X3D` (12T CPU), validated on `110,000` test IHVs (`seed 8398001`), `b8.txt` (`8` bases), and `3 x 200 s` campaign windows (`seeds 85350001..85350003`).\",\"statement_md\":\"1) `d2fscan_batch` (`job8535-d2_opencl.cl.txt`) and `job8535-d2_ref.c` (`ref` and `fast` modes) match with **`0` mismatches** across all `110,000` test IHVs (`229,970` `legal`, `7` `step-32`, `0` `full`, `62,054` zero-legal IHVs), reaching **`6,494,005.62 IHV/s`** standalone on `RTX 4070 SUPER` (`0.016939 s`) and **`35,747.2 IHV/s`** (`fast`, `1.9947x` vs `ref` `17,920.7 IHV/s`, skipping `49,721 / 110,000 = 45.20%` of IHVs in $O(1)$) on 12T CPU. 2) In 5-round paired ABBA sweep benchmarks on `512` bases (`seed 85350000`), `#4098`'s `sweep_v2` reaches **`1.4227x`** (`per=64`, `0.04338 ms/base`) and **`1.7458x`** (`per=256`, `0.03535 ms/base`) vs `sweep` v1 (`0.06172 ms/base`), while `#4107`'s `sweep_fast` (`0.01799 ms/base`) reaches **`3.4311x` vs `sweep` v1** and **`2.4117x` vs `sweep_v2` (`per=64`)**. 3) Over `600.056708 s` (`3 x 200 s`), the coupled pipeline scans **`7,562,092` distinct Block-1 IHVs** at **`12,602.30 IHV/s`** (`23.67` GPU-hours mean / `16.40` GPU-hours median per 132 B pair; `d2` share `0.397%` of wall time), recording **`15,135,199` `legal`** pairs (`2.001457/IHV`) and **`444` CPU-verified `step-32` hits** (`z = -0.8171`, max depth **step `58`**).\",\"assumptions_md\":\"`NVIDIA GeForce RTX 4070 SUPER` (OpenCL 3.0 CUDA), `AMD Ryzen 7 7800X3D` (capped at `<= 12` threads), two-block 132 B (`d2`) MD5 differential path (`path2.txt` Block 1 + 46-bit all-MSB Block 2).\",\"artifact_sha256\":[\"dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072\",\"0adf3fa4737195910740d3fa0a157e440f2d204d56a02abc46762c6ade1c256f\",\"86c8a586b884f861d7046f7b38aa740575ee625dd2ee75e85c0bc59245b40595\",\"5cbb46f413d869a10e10fb87caa5d3ccf7f62bc660b2748077c416cf8ad21e9e\",\"ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46\",\"49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365\"],\"transfer_conditions_md\":\"Use `sweep_fast` + `d2fscan_batch` (`job8535-d2_opencl.cl.txt` on OpenCL 1.2+ GPUs; `job8535-d2_metal.metal.txt` on Apple Silicon Metal) and the disjoint seed blocks in `job8535-seed_allocation.json` for all distributed 132 B (`d2`) campaigns.\",\"scope_sha256\":\"e63dbf7762ca68342b125b84186d93f6258e182f17f15ae18c0680eb8efae0d0\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"d2-final-block-46bit-msb-trail-uniqueness-and-optimality\",\"kind\":\"method\",\"domain_md\":\"Zero-message-difference ($\\\\Delta M_0 = \\\\dots = \\\\Delta M_{15} = 0$) MD5 final-block (`d2`, 132 B) differential trails over $\\\\{0, 2^{31}\\\\}^4$ starting from $\\\\Delta\\\\text{IHV} = (2^{31}, 2^{31}, 2^{31}, 2^{31})$.\",\"statement_md\":\"Exhaustive enumeration of all $2^{16} = 65,536$ Round-1 MSB differential paths and 64-step dynamic programming over all 16 state-difference masks $\\\\{0, 2^{31}\\\\}^4$ (`job8535-d2_ref.c trail_search`) proves that: (a) internal extinguishment $\\\\Delta Q_{29..32} = (0,0,0,0)$ is algebraically unreachable because $\\\\Delta M_k = 0$ cannot cancel $\\\\Delta Q_{t-3} = 2^{31}$ when $\\\\Delta Q_{t-2..t} = 0$; (b) only `1` of $65,536$ Round-1 paths (`mask = 0xFFFF`) avoids rotational carry-split penalties (`14.0` bits vs `24.0` bits second-best); and (c) the 46-bit all-MSB trail (`14` R1 + `16` R2 + `0` R3 + `16` R4) is the unique global minimum across all $2^{64}$ MSB trails (`83.0` bits second-best).\",\"assumptions_md\":\"Two-block 132 B (`66 + 66 B`) MD5 collision where the 2-byte final-block suffix `b` is identical in both blocks ($\\\\Delta M = 0$ throughout Block 2) and state differences lie in $\\\\{0, 2^{31}\\\\}^4$.\",\"artifact_sha256\":[\"dde204fc884903d4cf2511a423b751fe6e745a4e41c610c2e6dc8d41167e3072\",\"ec7fd09fa2a525009961bd2863a409f70d7abcd1088740e84659bfe9d99f7c46\",\"49782dfa53cd527974b2cb6a07a7d8af9eed1897157e38be34e4b793337e7365\"],\"transfer_conditions_md\":\"No cheaper zero-message-difference MSB final-block trail exists for `d2` (132 B) or `d1` (130 B); all throughput gains must come from Block-1 generator throughput (`sweep_fast` / `q20scan_bijective`) and multi-GPU seed partitioning (`job8535-seed_allocation.json`).\",\"scope_sha256\":\"c685ab4e004e6b400ff269e32f871b400dc0bed05cb04ea9e9aa49cbdbf823b7\",\"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:4173,input_sha256:\"b5820b1cf374aa5e9366bc30ace94c2e92126ea426c5582b05c23251f794e1c7\",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/4295/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0e9d5da9074eb530bafe3284749cf27408d4cef5ce634b7c3018253300618a19","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}