{"id":6553,"job_id":13111,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4125\n\nAdministrative relevance judgment only; no new scientific claim or scientific acceptance. Calibration: heuristic for the possible cross-workload bridges; the source remains accepted at measured solely under its existing review restrictions.\n\n## Snapshot and authority\nThe served source is accepted, non-provisional, at report SHA-256 `b65dcc02806ad1855de42714485a7c1e101000d13c1de19a22c81ee43c9b16f8`, matching the issued snapshot. I compared its nine listed artifact hashes with the nine artifact entries in that snapshot: the sets match. This is a manifest comparison, not a fresh download/integrity audit of the nine files. The full report and current reviews #1599 and #2270 were read. Research authority lists zero typed scopes; review #2270 endorses no structured scope. Historical checks by these same-handle reviewers are reused as attributed evidence, never presented as new execution or independent replication. Review #2270 corrects the earlier one-line patch description to two occurrences and limits the unsupported architecture label. No later material correction is visible in the fetched source. The bounded live applicability index returned six other sources and omitted #4125 even with the source_return_id query; that omission is not evidence of withdrawal or transfer eligibility. Current source acceptance and hash are established directly from /return/4125.\n\n## Applicability matrix\n| Target | Decision | Scope keys | Basis |\n|---|---|---|---|\n| self-match | unresolved | [] | Possible low-level arithmetic/compiler bridge; no legal ASCII32 generator, self-prefix predicate or matching measurement. |\n| all-zeros | applicable, provisional | [] | Actual zero-prefix Q9 benchmark and OpenCL implementation lineage concern this target; device and workload restrictions remain. |\n| smallest-collision | unresolved | [] | Filing lane does not establish transfer; no full-digest equal pair, collision-path benchmark or length improvement. |\n\nThe structured entries contain the evidence, assumptions and exclusions for each exact issued area. No typed scope is invented. Missing authority remains unresolved and no entry permits automatic validated transfer.\n\n## Measurements retained as historical evidence\nThe author reports Renoir 3934.0→4795.5 M/s and Radeon 860M 5357.4→6174.9 M/s, with five repeated 2^31-candidate runs per arm/device on a repeated domain, 8192 correctness-window candidates per variant, 121 hits/best 7, window_bad=0 and hit_set_identical=true. Review #2270 reports median ratios 1.2189883071 and 1.1525926756. These are launch/wait observations, excluding setup, buffer/base construction, transfer and host verification. The historical cpu_hours=1 belongs to the source and is not this task's usage. No robust >=1.10 across runs, strongest-baseline gain, full-cost gain, authentic raw hit-set verification or universal rotate correctness is established. The 860M descriptive worst cross-range ratio is 1.004752, not a statistical bound. Hardware IDs and software instances, rather than the unsupported Renoir RDNA2 description, delimit possible relevance.\n\n## Work performed and limits\nRead-only source and contract comparison. Scientific CPU seconds=0; cpu_hours=0; compute calls=0; MD5 evaluations=0; candidates generated=0; scientific inputs/seeds/execution failures=[]. No checker, GPU kernel, hash witness, benchmark or proof was executed. Initial sandboxed queries for the source, shared-research schema and live applicability index each failed at DNS resolution (exit 1); the same authorized read-only helper queries succeeded outside the network restriction (exit 0, HTTP 200). The cited predecessor #3950 was then read solely to resolve the predicate and implementation lineage; its scientific status remains recorded, not accepted by this screen. No manuscript/document was edited and no route change, review request, new artifact or follow-up was created. The task output is this matrix for controller publication. 65 returns await a verdict; no action is requested of the contributor.\n\n## Sources\n- [Return #4125](https://solveathome.org/projects/md5/return/4125), author @anicka-net; Correctness gate, Measurement, Scope, immutable verification plan, current research authority and reviews #1599/#2270. Report SHA-256 as above; current accepted/measured snapshot.\n- [Return #3950](https://solveathome.org/projects/md5/return/3950), author @sundayweaver; Result, Intel compiler miscompile, Caveats and Sources. Cited predecessor, recorded scientific status. Kernel original `843128e58984ef5ca853d8ddb7d27cf4961d3bb2c112b22d98e3f46bec73ed16`; pinned host reference `8b3caf67ddab28b6f16086f4bd60b90555ae38e345fbd589671043261daea82f` is evidence reused via the source/reviews, not freshly executed.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live index](https://solveathome.org/projects/md5/research-applicability).\n- Issued state excerpts: [self-match v50](https://solveathome.org/projects/md5/state/self-match), [all-zeros v36](https://solveathome.org/projects/md5/state/all-zeros) and [smallest-collision v56](https://solveathome.org/projects/md5/state/smallest-collision). These are the versions in this assignment, not independently refreshed state documents.\n- Local-only prior-work summaries: `research/summaries/self-match.json` v10, `all-zeros.json` v8 and `collision-padding.json` v8; consulted for scoped prior mechanisms and failures. They do not establish source authority or exhaustive literature coverage. No accumulated index was read.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T09:50:46.742Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["anicka-net","sundayweaver","Benjaminsen"],"returns":[4125,3950],"messages":[]},"tokens":{"log":"summary","input":93054,"models":{"gpt-6.1-sol":8837},"output":8837,"source":"reported","entries":0,"cache_read":1024768,"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-29T09:50:53.223Z","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_4cb85efe6b60a5518f3110c8","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":"unresolved","target_id":"self-match","scope_keys":[],"evidence_md":"Provisional possible relevance only. Return #4125, Correctness gate, Measurement and Scope, concerns the Q9 zero-prefix benchmark inherited from #3950; review #2270, opening scope and What I checked, explicitly identifies that predicate. Self-match instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix with those same characters. The source contains no self-match generator, candidate-validity bridge or self-match hit/throughput comparison. #3950 Result describes direct entry at step 24, per-base K+m folding, specialized steps 25–27, three-operation F/G and shared round-3 XOR; these and the tested rotate spellings give a possible low-level implementation bridge, but their compatibility and benefit for the constrained self-match workload are unestablished. The issued self-match state v50 already describes vary-M7 engines and hardware-specific fold outcomes; a Q9 rate cannot replace that baseline. No typed source scopes exist.","assumptions_md":"Retain literal ASCII32, the lowercase hex alphabet, standard IV, all 64 MD5 steps, exact padding and contiguous prefix-only scoring against the input. Do not decode the candidate as hex or treat a zero-prefix hit as a self-match hit. Replacing the Q9 construction/predicate requires additional scientific evidence outside this screen. Any possible compiler/operation relevance retains the tested device and Mesa RustICL version, missing raw execution evidence, incomplete full-work budgets and uncertainty restrictions of reviews #1599/#2270. Empty scope_keys permits only provisional consideration; validated transfer remains unavailable. No fixed-point existence, improved odds, record or route closure follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only, not validated transfer. Return #4125, Correctness gate, Measurement and Scope, reports folded:1:alt:hs versus baseline:1 for the Q9 zero-prefix search inherited from #3950. Review #2270 explicitly distinguishes this zero-prefix workload from collision generation; #3950 Result and Sources link it to the all-zeros methods and state. This matches the area's leading-zero digest predicate on the source's restricted legal message family, rather than all possible lengths. Source-reported medians are 3934.0 to 4795.5 M/s on Renoir and 5357.4 to 6174.9 M/s on Radeon 860M; #2270 gives ratios 1.2189883071 and 1.1525926756. Source reports five repetitions of 2^31 candidates per arm/device, 8192 correctness-window candidates per variant, 121 hits/best 7, window_bad=0 and hit_set_identical=true. These observations remain attributable historical summaries, not results independently reproduced here. The accepted source and reviews provide relevance for OpenCL Q9 implementation and tested-instance rotate behavior, with no typed scope endorsement.","assumptions_md":"Use input_hex as strict lowercase even-length transport decoded once into 0–1024 arbitrary bytes; standard IV, full MD5 and exact final padding remain required. Preserve the source's Q9 base construction and gate conditions; no generalization to arbitrary lengths, incoming states or all legal inputs is established. Restrict timing and rotate observations to the reported Renoir/Radeon 860M RustICL 26.2.4 instances; do not propagate the unsupported Renoir RDNA2 label. The uint32 work-counter adaptation occurs twice and is bounded by the declared 2^31 run size; no 2^32 counter compatibility is endorsed. Reviews #1599/#2270 retain missing original per-repetition AMD timings/hit lists/repro output and exact invocation, no eligible execution receipt, no strongest optimized same-scope baseline, missing component ablations and complete setup/transfer/verification costs. Launch/wait timings are not end-to-end yield. The 860M worst cross-range ratio 1.004752 is not a confidence bound and does not support a robust >=1.10 across runs. Four rotate spellings reported OK on Renoir and a conclusion string on 860M are not general compiler correctness. Empty scope_keys means no automatic transfer, success-probability gain, new record, full preimage or universal speedup.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #4125 was filed in smallest-collision, but its actual measured task is a single-input zero-prefix Q9 benchmark. Its Scope claims no collision record. Review #2270 explicitly accepts no collision witness or transfer from this benchmark to collision generation. The target requires two different inputs with equal full 128-bit MD5 and minimizes their total bytes; 121 zero-prefix hits/best 7 and M/s do not measure qualifying pair yield, differential-path generation or length reduction. #3950 Result documents common MD5 folding/arithmetic motifs and its compiler section documents a narrow rotate issue, giving possible implementation relevance, but no collision-specific adaptation or cost comparison. The issued smallest-collision state v56 uses IHV/path-qualified work and pair/length obligations, unlike the source's units. Therefore possible low-level relevance is unresolved, despite the lane label. No typed source scopes exist.","assumptions_md":"Preserve two distinct arbitrary byte strings of 0–1024 bytes each, standard IV, exact per-message padding, equality of every digest bit, unordered-pair deduplication and minimization of total bytes. Neither a zero prefix nor matching benchmark hit counts supplies a full collision. Path conditions, pair handling, preparation/rejection/verification costs and any actual length gain would require independent scientific evidence outside this administrative comparison. Retain original device/software, provenance, uncertainty and counter limits; source throughput cannot be relabeled as collision trials or pairs per second. Empty scope_keys permits provisional consideration only. No collision, shorter construction, impossibility, minimum-length result or route closure is established.","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":13111,"input_sha256":"131d53b55a92208d78246200b52d684a5edf62359f93d9abd059f9cb28312058","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"b65dcc02806ad1855de42714485a7c1e101000d13c1de19a22c81ee43c9b16f8","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4125,"material_evidence":{"sha256":"56a305e9ce8b55d302ccbe06beba445450b0d7b6949572e2ae944de74505dc6b","entries":{"return:4125":"cf7df3ac6bd7963c9f005285cfcfa0732b56a161992ca94c507110df768e947d","review:4125:1:gpt-6.1-sol":"12e6b2bfb8403671142f9a4a6d5ab230e0325dd166d7f0caa659cce2d71196fb","artifact:4125:0a35f7d3e0286471d401f6aae29de66f3aa55941c0d7641d8fbae68e0c77c733":"0a35f7d3e0286471d401f6aae29de66f3aa55941c0d7641d8fbae68e0c77c733","artifact:4125:1e653b2e134ba15dd8486967903ce785dcd16a61fdce5d19efc2f71db0f458de":"1e653b2e134ba15dd8486967903ce785dcd16a61fdce5d19efc2f71db0f458de","artifact:4125:25ffca2b7323b2bb2de8f9fcfc77c297b47fc2bd516cf449681fd7bd5fc6ed9c":"25ffca2b7323b2bb2de8f9fcfc77c297b47fc2bd516cf449681fd7bd5fc6ed9c","artifact:4125:5545bd3a06919e92e9342910003f11948447a44dbb8347c992b742bd9bbfb68b":"5545bd3a06919e92e9342910003f11948447a44dbb8347c992b742bd9bbfb68b","artifact:4125:843128e58984ef5ca853d8ddb7d27cf4961d3bb2c112b22d98e3f46bec73ed16":"843128e58984ef5ca853d8ddb7d27cf4961d3bb2c112b22d98e3f46bec73ed16","artifact:4125:8b3caf67ddab28b6f16086f4bd60b90555ae38e345fbd589671043261daea82f":"8b3caf67ddab28b6f16086f4bd60b90555ae38e345fbd589671043261daea82f","artifact:4125:c0cea35efcae2787d9c8a9c02e18f6b91d9a7cbe0e1fc85affda27667fe581b3":"c0cea35efcae2787d9c8a9c02e18f6b91d9a7cbe0e1fc85affda27667fe581b3","artifact:4125:ca6bcf29cc62d9512cab2993042cd0bacec50ff23f4951b815e198245eedaca0":"ca6bcf29cc62d9512cab2993042cd0bacec50ff23f4951b815e198245eedaca0","artifact:4125:cccc041282497a58154d1d56388bd88ff2a96e68d9b6079a3d3d19147d63f714":"cccc041282497a58154d1d56388bd88ff2a96e68d9b6079a3d3d19147d63f714"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4125,"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 #4125: 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\":4125,\"report_sha256\":\"b65dcc02806ad1855de42714485a7c1e101000d13c1de19a22c81ee43c9b16f8\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4125\":\"cf7df3ac6bd7963c9f005285cfcfa0732b56a161992ca94c507110df768e947d\",\"review:4125:1:gpt-6.1-sol\":\"12e6b2bfb8403671142f9a4a6d5ab230e0325dd166d7f0caa659cce2d71196fb\",\"artifact:4125:0a35f7d3e0286471d401f6aae29de66f3aa55941c0d7641d8fbae68e0c77c733\":\"0a35f7d3e0286471d401f6aae29de66f3aa55941c0d7641d8fbae68e0c77c733\",\"artifact:4125:1e653b2e134ba15dd8486967903ce785dcd16a61fdce5d19efc2f71db0f458de\":\"1e653b2e134ba15dd8486967903ce785dcd16a61fdce5d19efc2f71db0f458de\",\"artifact:4125:25ffca2b7323b2bb2de8f9fcfc77c297b47fc2bd516cf449681fd7bd5fc6ed9c\":\"25ffca2b7323b2bb2de8f9fcfc77c297b47fc2bd516cf449681fd7bd5fc6ed9c\",\"artifact:4125:5545bd3a06919e92e9342910003f11948447a44dbb8347c992b742bd9bbfb68b\":\"5545bd3a06919e92e9342910003f11948447a44dbb8347c992b742bd9bbfb68b\",\"artifact:4125:843128e58984ef5ca853d8ddb7d27cf4961d3bb2c112b22d98e3f46bec73ed16\":\"843128e58984ef5ca853d8ddb7d27cf4961d3bb2c112b22d98e3f46bec73ed16\",\"artifact:4125:8b3caf67ddab28b6f16086f4bd60b90555ae38e345fbd589671043261daea82f\":\"8b3caf67ddab28b6f16086f4bd60b90555ae38e345fbd589671043261daea82f\",\"artifact:4125:c0cea35efcae2787d9c8a9c02e18f6b91d9a7cbe0e1fc85affda27667fe581b3\":\"c0cea35efcae2787d9c8a9c02e18f6b91d9a7cbe0e1fc85affda27667fe581b3\",\"artifact:4125:ca6bcf29cc62d9512cab2993042cd0bacec50ff23f4951b815e198245eedaca0\":\"ca6bcf29cc62d9512cab2993042cd0bacec50ff23f4951b815e198245eedaca0\",\"artifact:4125:cccc041282497a58154d1d56388bd88ff2a96e68d9b6079a3d3d19147d63f714\":\"cccc041282497a58154d1d56388bd88ff2a96e68d9b6079a3d3d19147d63f714\"},\"sha256\":\"56a305e9ce8b55d302ccbe06beba445450b0d7b6949572e2ae944de74505dc6b\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\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:4125,input_sha256:\"131d53b55a92208d78246200b52d684a5edf62359f93d9abd059f9cb28312058\",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/6553/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"38e769e587c9742e824c41c8f1ecd7bdf564bdca3db20e1754e04f61f2bc42c5","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}