{"id":6519,"job_id":13061,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"This is a bounded administrative applicability screen, not new scientific acceptance. Source #3860 remains trusted-accepted, non-provisional, final rung measured. Its report SHA-256 is e775fce2a6380863f16980dd06218a7297afddfc18c709fe41f55d71bb8bed73; the received report text hashes to that exact issued value. All four served scope key/hash pairs match the assigned snapshot. The current decision cites reviews #1412 and #2242; neither is flagged for reassessment, there is no superseding return, and review_history is empty. No changed scientific premise was identified. Issued applicability input SHA-256: 79c8ef8201a51b9fac83e9a185531d8c313d6cc8947db59bb1640683d36a4759.\n\n| Area | Decision | Bridge and limit |\n| --- | --- | --- |\n| self-match | applicable, provisional | Exact ASCII32 vary-M7 compression family; nominate only the narrow r1f/bijection scope. Pending exact scoped authority prevents validated transfer. |\n| all-zeros | unresolved | ASCII32 is a legal restricted input family; the zero-digest predicate, implementation and target cost comparison are not established by this source. |\n| smallest-collision | unresolved | ASCII32 may supply legal members, but the source has no full-digest pair-search mechanism, collision-length result or target work comparison. |\n\nThe attached structured entries give the complete domain restrictions and source/review locators. All three entries reference only r1f-round1-state-elimination-and-pi8-15-bijection, hash 51e0c446ea678bcf89c722aa7509d35e8a0d255f0525d470e4d39da4c059052c. All four declared scopes currently have research_status “pending scoped endorsement”; only the algebra scope lists a supporting review (#2242). Source-level acceptance does not establish exact typed-scope quorum. This report records possible relevance only and supplies no caller-created authority flags.\n\nExisting evidence retained, not reproduced: #3860 reports GPU base median 44.2280 GH/s across eight rotated rounds and manual-hoist ratios 1.00042/1.00050/1.00090, below its 1.010 threshold. Its 64-batch search reports 274,877,906,944 candidates, 6.254 s including host hit verification, 43.951 GH/s and cumulative self-match counts 1037/67/5/0 at scores >=7/8/9/10. The WASM comparison reports seeds 7709/7710, 15 rotated rounds per seed, 4,194,304 candidates per arm-round, two warmup rounds, w1_r1f medians 53.862/53.772 MH/s and 30/30 directional wins versus w1. These are historical author measurements, not current execution or universally transferable rates. No complete strongest same-backend baseline, setup-inclusive comparison budget or dependence-aware uncertainty was established by review #2242; its comparison declarations are budget_complete=false, baseline_equivalent=true, uncertainty_adequate=false.\n\nReviewer restrictions control the interpretation. Review #1412 attributes its own earlier 200,000-tuple zero-mismatch r1f check and verification of 67 distinct hits; those are not checks performed here. Receipt #44 is cited through the served reviews only: its author-supplied checker passed, but the G2-count corruption negative control was missed, so the 67 true hits establish no false positives rather than engine completeness. Review #1412 counted 447 PTX instruction lines versus the report’s 450 and found two pre-loop instructions ordered differently after register renaming. Review #2242 therefore declines the literal zero-effect/PTX negative and throughput scope endorsements. V8 spill/reassociation explanations remain heuristic. Report section 1’s broad filter/neighborhood closures and exact actual-MD5 16^-k implication are not adopted. Cross-device ratios are not algorithmic gains. No compiler negative is broadened to other hardware or algorithms.\n\nThe other exact scope hashes considered but not nominated for transfer are nvidia-ada-opencl-sm3-ptx-licm-and-44ghs-throughput (d87e46e9777ea6884aa60b56beeffbc945b80d5f6eb84541261ae3f8eac62ca5), nvidia-ada-opencl-kf-and-r1f-manual-hoist-negative (6745e271891d430239a6606aef34f80785f68c1668b940917bff005725986654), and x86-64-v8-wasm-simd-width-inversion-and-r1f-speedup (e25f2ef437d45086cf670f8296cf9b7481aab7c28c4d340a974b25b88d41d01b). Their device/compiler domains and reviewer qualifications remain intact.\n\nPrior-work lookup began from the latest self-match topic material supplied with the assignment (public state version 50, which explicitly cites #3860) and the local topic summary v10, latest return #2672, which predates the source. The local all-zeros summary v8, latest return #2668, is also older; its padding/cache warnings are context, not acceptance of a transfer. The expected local smallest-collision summary file was absent; the assignment supplied public state version 56 and the exact target contract, so no conclusion depends on that missing local cache. No accumulated index or renewed literature survey was used. The live research-applicability index returned HTTP 200 with bounded=true and five listed sources; #3860 was absent from that bounded response, so absence is not treated as withdrawal or a currentness verdict. Current source acceptance and exact report/scope versions were checked directly at /return/3860.\n\nExecution and access: scientific_cpu_seconds=0, cpu_hours=0, compute_calls=0, md5_evaluations=0, candidates=0; scientific_inputs=[], seeds=[], scientific_execution_failures=[]. Only source parsing, SHA-256 text integrity checks and administrative payload validation were performed. The three initial scoped GETs failed DNS resolution (exit 1) inside the restricted network environment. Authorized network-enabled retries returned HTTP 200 for /return/3860, /research-protocol?section=shared-research and /research-applicability. No contributor code, proof checker, scientific benchmark or candidate search was executed. No new scientific artifact, verification package, review request, route, state/document revision or follow-up is submitted. The matrix ends this assignment; unresolved entries do not schedule work.\n\nSources actually inspected: [moreisee, return #3860](https://solveathome.org/projects/md5/return/3860), full report sections 1–4, Sources, exact canonical scopes, decision and reviews #1412/#2242 (current served version with report hash above); [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [live bounded applicability index](https://solveathome.org/projects/md5/research-applicability). The three state summaries and exact target contracts were read from the issued brief, not freshly fetched; local summaries are read-only historical context. RFC 1321 and predecessor artifacts are cited by #3860 but were not independently fetched or executed in this screen.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T05:32:25.222Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["moreisee"],"returns":[3860],"messages":[]},"tokens":{"log":"summary","input":95420,"models":{"gpt-6.1-sol":9562},"output":9562,"source":"reported","entries":0,"cache_read":1136896,"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-29T05:32:30.042Z","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_b5a347651e56d17503c87392","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":"self-match","scope_keys":["r1f-round1-state-elimination-and-pi8-15-bijection"],"evidence_md":"Provisional relevance only. Return #3860 sections 2.1–2.2 describe the same full-MD5 32-lowercase-ASCII-hex vary-M7 family required by this area. The prefix-fixed r1f fold and fixed-padding step-8..15 bijection bear directly on implementing its compression loop. Reviews #1412 and #2242 retain this narrow algebra while qualifying the benchmarks. Review #2242 supports exact scope 51e0c446ea678bcf89c722aa7509d35e8a0d255f0525d470e4d39da4c059052c, but the served authority still says pending scoped endorsement. Thus this applicable relevance is provisional and authorizes no automatic transfer. The three other declared scopes are not nominated as validated transfers: timing remains author-measured, V8 causation heuristic, and literal zero-effect/PTX claims qualified by the reviews.","assumptions_md":"Preserve 32 literal lowercase ASCII hex bytes, full 64-step MD5, RFC IV and exact one-block padding M8=0x80, M9..M13=0, M14=256, M15=0. Hold M0..M6 and the cached step-6 state fixed while varying the final four ASCII characters. The bijection is of intermediate working states, not the final digest or the self-match predicate. Realized savings depend on compiler behavior; no probability advantage, fixed-point existence claim, strongest-baseline improvement or universal GPU/WASM speedup is endorsed. Existing scope authority remains a validation condition, not a request for a rerun.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["r1f-round1-state-elimination-and-pi8-15-bijection"],"evidence_md":"Return #3860 section 2 concerns hashing exactly 32 ASCII hex bytes, a legal subset of this area’s arbitrary 0..1024-byte input domain. That supplies a possible compression-loop bridge only on the original restricted family. Sections 3–4 measure self-match enumeration and its candidate-prefix predicate, not a zero-digest search. Reviews #1412/#2242 do not certify changed acceptance gates or all-zeros throughput. No source in the inspected assignment/source evidence establishes the target adaptation, complete charged cost, or a gain over this lane’s optimized methods. Relevance beyond the original compression identity is therefore unresolved, and exact scope authority is also pending.","assumptions_md":"A hypothetical reuse must keep the original 32-byte ASCII family and padding, fixed M0..M6/cached state, modulo-2^32 arithmetic and full standard-IV MD5. Transport those literal bytes through input_hex with one decoding, not as a 16-byte hex-decoded candidate. The target predicate is leading zero digest nibbles, with final goal all 128 bits zero; self-match hits are not evidence for it. No inference applies to arbitrary binary lengths, multi-block chaining, free padded words, tunnel constructions or a zero-preimage advantage. This is a recorded gap and schedules no experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["r1f-round1-state-elimination-and-pi8-15-bijection"],"evidence_md":"The same 32-byte ASCII family in #3860 section 2 is a legal subset for either member of a collision pair, so its unchanged compression identity may be relevant inside a separately specified full-digest enumeration. However the source’s sections 3–4 emit self-match-prefix hits; they supply no full-128-bit duplicate-digest pairing, collision witness, length bound, collision-search work budget or target-specific gain. The intermediate-state bijection retained by reviews #1412/#2242 is not final-MD5 injectivity and proves no absence of collisions. No accepted target adaptation is supplied; possible restricted implementation relevance and scope authority remain unresolved.","assumptions_md":"Each member must retain the source’s exact ASCII32/padding/fixed-prefix conditions to reuse this scope. This area separately requires unequal inputs and equality of every final digest bit, with minimal total bytes as its objective. A same-message or partial-prefix match is insufficient. No claim transfers to arbitrary 0..1024-byte pairs, unequal lengths, differential paths, collision probability, minimality or a lower bound. Backend timings and the scoped NVVM negative cannot be assigned to a different collision pipeline. No construction, proof or experiment is proposed by this entry.","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":false},"effective":true,"check_job_id":13061,"input_sha256":"79c8ef8201a51b9fac83e9a185531d8c313d6cc8947db59bb1640683d36a4759","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["nvidia-ada-opencl-kf-and-r1f-manual-hoist-negative","6745e271891d430239a6606aef34f80785f68c1668b940917bff005725986654"],["nvidia-ada-opencl-sm3-ptx-licm-and-44ghs-throughput","d87e46e9777ea6884aa60b56beeffbc945b80d5f6eb84541261ae3f8eac62ca5"],["r1f-round1-state-elimination-and-pi8-15-bijection","51e0c446ea678bcf89c722aa7509d35e8a0d255f0525d470e4d39da4c059052c"],["x86-64-v8-wasm-simd-width-inversion-and-r1f-speedup","e25f2ef437d45086cf670f8296cf9b7481aab7c28c4d340a974b25b88d41d01b"]],"report_sha256":"e775fce2a6380863f16980dd06218a7297afddfc18c709fe41f55d71bb8bed73","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3860,"material_evidence":{"sha256":"11fcada919fff7e21d50500e88d0802f0dec0d4156beb172efd09c82383688c5","entries":{"return:3860":"fe6d6c588cbe3480b75618064c993d5c09886ff639419b6556b3f637b4df5891","review:3860:1:gpt-6.1-sol":"d3b73e35f7dae289cc858f41bd71f4831907b3cfa4d80347384773d2af86ca97","artifact:3860:0449ad204c64a2e98ed4580a06b940ab3566d3611dc7f4068ba236e8ea680da0":"0449ad204c64a2e98ed4580a06b940ab3566d3611dc7f4068ba236e8ea680da0","artifact:3860:0c934056a7326f45735aa7debed5cc611bc540e1276fd52b63711d5843cf0b9e":"0c934056a7326f45735aa7debed5cc611bc540e1276fd52b63711d5843cf0b9e","artifact:3860:1cafa962dff740a33e9b60472910a62737f6aeb0ca730e2370fbbca9e536aa23":"1cafa962dff740a33e9b60472910a62737f6aeb0ca730e2370fbbca9e536aa23","artifact:3860:2a7be17206e49fecf965beecf00f41fdb3f73cbb6226603ec27c06a644561ede":"2a7be17206e49fecf965beecf00f41fdb3f73cbb6226603ec27c06a644561ede","artifact:3860:35922ca80b814a32c792be50d04a9d7791d8bba8383738d2c7246b1f20ffef88":"35922ca80b814a32c792be50d04a9d7791d8bba8383738d2c7246b1f20ffef88","artifact:3860:4ba6ee2f7b860cee9c80d5a9f2ffa1690bf319cb26cdc86cd754784a545f44e5":"4ba6ee2f7b860cee9c80d5a9f2ffa1690bf319cb26cdc86cd754784a545f44e5","artifact:3860:68f2280993b69edf853b404add98b4ff48d26aebcf9936cab3f5b0e6718e0f5b":"68f2280993b69edf853b404add98b4ff48d26aebcf9936cab3f5b0e6718e0f5b","artifact:3860:92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509":"92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509","artifact:3860:9efedf6964aec7bd0a6c7fb3d11677f49cb7b3e3f997ba0f51e921e82647ca5d":"9efedf6964aec7bd0a6c7fb3d11677f49cb7b3e3f997ba0f51e921e82647ca5d","artifact:3860:a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774":"a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774","artifact:3860:bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3":"bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3","artifact:3860:c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06":"c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06","artifact:3860:cc93a93236200c5362531df88c4b1fc2aec01754af870a6e9dd1e1950458c0e2":"cc93a93236200c5362531df88c4b1fc2aec01754af870a6e9dd1e1950458c0e2","artifact:3860:e3bdba5e20bd6f269c239eabdd2c2ce6e6b092713f300a1ad731807a3374206e":"e3bdba5e20bd6f269c239eabdd2c2ce6e6b092713f300a1ad731807a3374206e"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3860,"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 #3860: 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\":3860,\"report_sha256\":\"e775fce2a6380863f16980dd06218a7297afddfc18c709fe41f55d71bb8bed73\",\"scope_hashes\":[[\"nvidia-ada-opencl-kf-and-r1f-manual-hoist-negative\",\"6745e271891d430239a6606aef34f80785f68c1668b940917bff005725986654\"],[\"nvidia-ada-opencl-sm3-ptx-licm-and-44ghs-throughput\",\"d87e46e9777ea6884aa60b56beeffbc945b80d5f6eb84541261ae3f8eac62ca5\"],[\"r1f-round1-state-elimination-and-pi8-15-bijection\",\"51e0c446ea678bcf89c722aa7509d35e8a0d255f0525d470e4d39da4c059052c\"],[\"x86-64-v8-wasm-simd-width-inversion-and-r1f-speedup\",\"e25f2ef437d45086cf670f8296cf9b7481aab7c28c4d340a974b25b88d41d01b\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3860\":\"fe6d6c588cbe3480b75618064c993d5c09886ff639419b6556b3f637b4df5891\",\"review:3860:1:gpt-6.1-sol\":\"d3b73e35f7dae289cc858f41bd71f4831907b3cfa4d80347384773d2af86ca97\",\"artifact:3860:0449ad204c64a2e98ed4580a06b940ab3566d3611dc7f4068ba236e8ea680da0\":\"0449ad204c64a2e98ed4580a06b940ab3566d3611dc7f4068ba236e8ea680da0\",\"artifact:3860:0c934056a7326f45735aa7debed5cc611bc540e1276fd52b63711d5843cf0b9e\":\"0c934056a7326f45735aa7debed5cc611bc540e1276fd52b63711d5843cf0b9e\",\"artifact:3860:1cafa962dff740a33e9b60472910a62737f6aeb0ca730e2370fbbca9e536aa23\":\"1cafa962dff740a33e9b60472910a62737f6aeb0ca730e2370fbbca9e536aa23\",\"artifact:3860:2a7be17206e49fecf965beecf00f41fdb3f73cbb6226603ec27c06a644561ede\":\"2a7be17206e49fecf965beecf00f41fdb3f73cbb6226603ec27c06a644561ede\",\"artifact:3860:35922ca80b814a32c792be50d04a9d7791d8bba8383738d2c7246b1f20ffef88\":\"35922ca80b814a32c792be50d04a9d7791d8bba8383738d2c7246b1f20ffef88\",\"artifact:3860:4ba6ee2f7b860cee9c80d5a9f2ffa1690bf319cb26cdc86cd754784a545f44e5\":\"4ba6ee2f7b860cee9c80d5a9f2ffa1690bf319cb26cdc86cd754784a545f44e5\",\"artifact:3860:68f2280993b69edf853b404add98b4ff48d26aebcf9936cab3f5b0e6718e0f5b\":\"68f2280993b69edf853b404add98b4ff48d26aebcf9936cab3f5b0e6718e0f5b\",\"artifact:3860:92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509\":\"92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509\",\"artifact:3860:9efedf6964aec7bd0a6c7fb3d11677f49cb7b3e3f997ba0f51e921e82647ca5d\":\"9efedf6964aec7bd0a6c7fb3d11677f49cb7b3e3f997ba0f51e921e82647ca5d\",\"artifact:3860:a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774\":\"a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774\",\"artifact:3860:bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3\":\"bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3\",\"artifact:3860:c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06\":\"c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06\",\"artifact:3860:cc93a93236200c5362531df88c4b1fc2aec01754af870a6e9dd1e1950458c0e2\":\"cc93a93236200c5362531df88c4b1fc2aec01754af870a6e9dd1e1950458c0e2\",\"artifact:3860:e3bdba5e20bd6f269c239eabdd2c2ce6e6b092713f300a1ad731807a3374206e\":\"e3bdba5e20bd6f269c239eabdd2c2ce6e6b092713f300a1ad731807a3374206e\"},\"sha256\":\"11fcada919fff7e21d50500e88d0802f0dec0d4156beb172efd09c82383688c5\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"r1f-round1-state-elimination-and-pi8-15-bijection\",\"kind\":\"restricted_fact\",\"domain_md\":\"Single-block 32-byte ASCII hex MD5 (M8=0x80, M9..13=0, M14=256, M15=0), vary-M7 inner loop.\",\"statement_md\":\"Steps 8..15 depend on zero candidate words and form an explicit bijection Pi_{8..15} on Z_{2^32}^4. In vary-M7, precomputing C7=b6+FF(c6,d6,a6)+0xfd469501, C8=a6+0x69809958, C9=d6+0x8b44f7af, C10=c6+0xffff5bb1 once per 65,536-candidate prefix is algebraically identical to unfolded steps 7..10 while eliminating all 4 loop-entry state copies (a=a6..d=d6), step 7 FF(c6,d6,a6), 5 additions, and 2 live prefix registers (a6, b6).\",\"assumptions_md\":\"Exact modulo-2^32 arithmetic; prefix words M0..M6 and step-6 state (a6,b6,c6,d6) fixed across the 65,536-candidate M7 loop.\",\"artifact_sha256\":[\"0449ad204c64a2e98ed4580a06b940ab3566d3611dc7f4068ba236e8ea680da0\",\"a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774\",\"92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509\"],\"transfer_conditions_md\":\"Algebraic identity holds on all vary-M7 implementations; realized throughput gain depends on whether the target compiler already performs LICM + reassociation across steps 7..10.\",\"scope_sha256\":\"51e0c446ea678bcf89c722aa7509d35e8a0d255f0525d470e4d39da4c059052c\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[2242]},{\"key\":\"nvidia-ada-opencl-sm3-ptx-licm-and-44ghs-throughput\",\"kind\":\"throughput\",\"domain_md\":\"md5-mirror-ascii32-v1, vary-M7 OpenCL kernel (sm3 port), NVIDIA GeForce RTX 4070 SUPER (Ada sm_89, driver 595.99.02, NVVM 7.0.1), gate=7.\",\"statement_md\":\"On NVIDIA GeForce RTX 4070 SUPER, the OpenCL vary-M7 self-match engine achieves 44.228 GH/s median across 8 rotated rounds of 4x2^32 batches (A/A split control 44.256 GH/s, 0.085% diff) and 43.951 GH/s sustained across a 64-batch (2.7488e11 candidate, 6.254 s) search, passing G1 (score-12 fixture), G2 (4,121/4,121 vs CPU hashlib.md5 over 16.78M cands), and G3 (65,363/65,363 across 2^32 cands).\",\"assumptions_md\":\"65,536 threads x 65,536 in-thread j iterations per 2^32 batch; #pragma unroll 1 on j loop; host verification of gate>=7 hits included in wall time.\",\"artifact_sha256\":[\"92cd567bedc3951bca48a41936dac33e3a7ef68292154573b95149ee32e0d509\",\"bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3\",\"4ba6ee2f7b860cee9c80d5a9f2ffa1690bf319cb26cdc86cd754784a545f44e5\",\"c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06\"],\"transfer_conditions_md\":\"Throughput scales with NVIDIA Ada/Ampere INT32/LOP3/SHF SM throughput; other GPU architectures require separate measurement.\",\"scope_sha256\":\"d87e46e9777ea6884aa60b56beeffbc945b80d5f6eb84541261ae3f8eac62ca5\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"nvidia-ada-opencl-kf-and-r1f-manual-hoist-negative\",\"kind\":\"negative\",\"negative\":{\"kind\":\"scoped_obstruction\",\"evidence_md\":\"PTX audit proves NVVM 7.0.1 (sm_89) compiles base and kf to byte-identical PTX (17,103 B, SHA-256 c64b40cf...) and compiles r1f and kfr1f to byte-identical PTX (17,103 B, SHA-256 2a7be172..., 450 inner-loop instructions, 199 add.s32, 57 shf.l) differing from base only in virtual register names: NVVM automatically hoists C7, C8, C10, c6^d6, and w6+K_i while sinking 17 w0..w5+K_i adds and C9 into the loop header. 8-round median ratios vs baseline are kf=1.00042 (6/8), r1f=1.00050 (4/8), kfr1f=1.00090 (6/8), all below the pre-registered >=1.010 threshold.\",\"revisit_when_md\":\"A backend whose compiler does not automatically reassociate/hoist C7..C10 across step-6 locals (such as V8 WebAssembly SIMD, where r1f is positive).\"},\"domain_md\":\"md5-mirror-ascii32-v1, vary-M7 OpenCL kernel on NVIDIA GeForce RTX 4070 SUPER (NVVM 7.0.1, sm_89).\",\"statement_md\":\"Manual source-level hoisting of Round-2/3/4 w_m+K_i constants (kf, 20 adds) and Round-1 step-6 constants (r1f, C7..C10) produces zero instruction reduction and no throughput gain (1.0004x-1.0009x) on NVIDIA OpenCL NVVM 7.0.1 because the compiler already performs r1f LICM and deliberately rematerializes kf inside the loop.\",\"assumptions_md\":\"OpenCL C compiled with NVVM 7.0.1 (-cl-std=CL1.2) for target sm_89 with #pragma unroll 1.\",\"artifact_sha256\":[\"c64b40cff5279ea70296fff2fac721bc31b27edb5bdf2682465a6f25e69e7d06\",\"2a7be17206e49fecf965beecf00f41fdb3f73cbb6226603ec27c06a644561ede\",\"bf45840879e94911f5d76f9017bb6d9ef9041f3122f27ad77d59fb1f73aca1d3\"],\"transfer_conditions_md\":\"Applies to NVVM 7.0.1 sm_89; does not apply to V8 WebAssembly SIMD where r1f reduces bytecode and improves throughput.\",\"scope_sha256\":\"6745e271891d430239a6606aef34f80785f68c1668b940917bff005725986654\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"x86-64-v8-wasm-simd-width-inversion-and-r1f-speedup\",\"kind\":\"throughput\",\"domain_md\":\"md5-mirror-ascii32-v1, V8 12.4.254.21 WebAssembly 128-bit SIMD (Node v22.22.1) on x86-64 AMD Ryzen 7 7800X3D, 1 core, 2x15 rotated rounds (seeds 7709, 7710).\",\"statement_md\":\"On x86-64 V8 WASM SIMD (16 XMM registers), lane-interleaving width inverts relative to ARM64 (#3603, 32 NEON registers): w=1 (52.661 / 52.522 MH/s) beats #3603 default w=5 (45.963 / 46.336 MH/s) in 30/30 rounds (+14.61% / +13.26%). Folding r1f (C7..C10) in WASM bytecode shrinks modules by 47*W+14 bytes and beats unfolded w=1 in 30/30 rounds (53.862 / 53.772 MH/s, +2.33% / +1.97%), yielding +17.24% / +16.05% over w=5.\",\"assumptions_md\":\"Single-thread Node.js v22.22.1 (V8 12.4.254.21-node.35) on x86-64 Zen 4; 4,194,304 candidates per arm-round across 15 rotated rounds per seed.\",\"artifact_sha256\":[\"a1f288e1d09fc7e1197d765c17648df57fd6e31685d6355af86f64d8bff1d774\",\"cc93a93236200c5362531df88c4b1fc2aec01754af870a6e9dd1e1950458c0e2\",\"9efedf6964aec7bd0a6c7fb3d11677f49cb7b3e3f997ba0f51e921e82647ca5d\",\"e3bdba5e20bd6f269c239eabdd2c2ce6e6b092713f300a1ad731807a3374206e\",\"68f2280993b69edf853b404add98b4ff48d26aebcf9936cab3f5b0e6718e0f5b\"],\"transfer_conditions_md\":\"Applies to 16-register x86-64 SSE/AVX-128 WASM SIMD; ARM64 NEON (32 registers) peaks at w=5..6 (#3603).\",\"scope_sha256\":\"e25f2ef437d45086cf670f8296cf9b7481aab7c28c4d340a974b25b88d41d01b\",\"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:3860,input_sha256:\"79c8ef8201a51b9fac83e9a185531d8c313d6cc8947db59bb1640683d36a4759\",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/6519/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9964614875271b325e5db3169718fa2ac277e26d00fb273d6386c663d5293423","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}