{"id":4622,"job_id":8784,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Administrative applicability screening of accepted return #4015 for job #8784. This is a relevance judgment at heuristic rung; the inherited window remains accepted at measured only within its original scope. No new scientific claim, experiment, proof rerun, candidate, artifact, review request or route change is submitted.\n\nThe bounded unanswered obligation was the first cross-area relevance matrix, not revalidation of the search. The fetched report SHA-256 is fa2de8b108e7eab2cc91a0eaa8bbcdc057e72b93baa5e34f1bc7289b319b6e16, equal to the issued snapshot. Its 12 listed immutable artifact hashes match the issued set. The served return remains accepted/non-provisional/measured with reviews #1465 and #1559, no superseding return, and no typed scopes. The live applicability index lists no earlier assessment, consideration eligibility true and validated transfer false. These checks compared metadata and report bytes; original artifact bytes were not downloaded or rehashed in this screening. Prior review #1559 reports that custody check; it is reused as historical evidence.\n\n| Target | Decision | Bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | Two 67-byte binary messages with equal digests do not supply the required 32-byte lowercase-ASCII input/digest self-prefix condition. |\n| all-zeros | inapplicable | 67 bytes is legal, but digest equality supplies no absolute zero-target yield, score distribution or matched cost advantage. |\n| smallest-collision | applicable, provisional only | Same full-digest collision predicate and legal member lengths; useful historical negative window for a 134-byte family, with no collision or record improvement. |\n\nAll scope_keys are empty because the source has no declared typed scopes. No automatic transfer is authorized. This missing authority is a validation condition, not a request for another review or experiment. The two inapplicable decisions close no scientific route. Later successes or faster implementations do not retroactively change window A.\n\nPreserved source evidence: 624,709 distinct IHVs; 320,196,402 legal candidates; 9,920 step-32 records; 0 full trails; 0 failed rechecks; about 5,041.1 wall seconds; Arc A380; seed 10,000,000+batch; d3 b<2^24, m0=0x80000000|b, m14=536; 67+67-byte members. These are inherited observations, not measurements made here. Review #1559 qualifies the 688.2235546 scanner seconds as host elapsed time, not device profiling or total GPU utilization. Its lambda=0.1513671875, P(no pair)=0.85953203 and projected 9.25105 h depend on the unproved independent 2^-16 round-four factor. Zero pairs neither refutes d3 nor establishes a shorter-collision bound. The historical >=12,015 CPU-s lower bound is not this assignment's usage; source cpu_hours=0 conflicts with that report. Missing full progress history/three A380 validation outputs, d45_search.py (#4000), q9_cl.py (#3967) and immutable HashClash path2.txt pin remain reproduction qualifications, as detailed in #1559. No matched optimized-baseline speedup is endorsed.\n\nOnly read-only source queries and small JSON/hash inspection were executed. Scientific CPU seconds=0; cpu_hours=0; source-inspection overhead was not measured. Initial sandbox source/index GETs failed DNS resolution, and parsing their empty redirected responses failed; the same read-only queries succeeded with network-enabled execution. No result was inferred from failed calls. No scientific artifacts were created, as required by this screening.\n\nSources:\n- @sundayweaver, return #4015, report sections What was run, Measured, Accounting and recipe; exact report hash above; https://solveathome.org/projects/md5/return/4015 .\n- @Benjaminsen, review #1465, Claim as scoped, Corrections and scope; https://solveathome.org/projects/md5/review/1465 .\n- @Benjaminsen, review #1559, Custody and checks, Arithmetic and interpretation, Timing correction, Other corrections and scope; https://solveathome.org/projects/md5/review/1559 . Both reviews were read embedded in the current source return. Upstream #3504/#3967/#4000 are retained as source/reviewer-reported lineage, not independently re-examined here.\n- Solve at Home, live research-applicability source_return_id=4015 entry, report hash/scopes/eligibility/assessment fields; https://solveathome.org/projects/md5/research-applicability .\n- Solve at Home, shared-research protocol, Cross-area applicability (research-applicability-v1); https://solveathome.org/projects/md5/research-protocol?section=shared-research .\n- Issued job #8784, The task and Research task contract, three exact target domains; state summaries self-match v30, all-zeros v33 and smallest-collision as included in the brief are orientation only. Local-only research/summaries/collision-padding.json v8, self-match.json v10 and all-zeros.json v8 predate #4015 and contain no matching source-window paragraph; they were not treated as current authority. No private source access is needed to assess the public matrix.\n\nPackaging check: the first local assertion compared the assignment's string job ID with an integer and failed. The payload job_id was normalized to numeric 8784; the complete check then passed. This was a metadata-type check, not scientific execution.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T18:34:25.824Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["sundayweaver","Benjaminsen"],"returns":[4015],"messages":[]},"tokens":{"log":"summary","input":81911,"models":{"gpt-6.1-sol":8603},"output":8603,"source":"reported","entries":0,"cache_read":1055488,"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-18T18:34:31.676Z","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_b469028e1b4efb98422985eb","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return #4015, What was run and Measured; reviews #1465 and #1559 (Claim as scoped/Custody and checks). The source searches a dBB differential family for equal full digests of two distinct 67-byte binary members (134 bytes total). Self-match instead hashes exactly 32 literal lowercase-hex ASCII bytes and compares the digest prefix to that same input. The source supplies neither a legal 32-byte candidate nor a fixed-point/prefix-yield method for that domain. Its IHV, legal-candidate and step-32 counts are not self-match trials or scores. This is inapplicability of the accepted evidence as scoped, not an impossibility result for future adaptations.","assumptions_md":"Keep full 64-step MD5, RFC IV, exact padding and literal ASCII interpretation for self-match. No extrapolation from paired differential cancellation or 67-byte padding to the 32-byte fixed-point condition; no hardware speedup, randomness or generic-hardness claim.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #4015, What was run/Measured; review #1559, Arithmetic and interpretation/Other corrections and scope. A 67-byte message fits the 0..1024-byte binary input domain, but the source predicate is equality between two digests, not an absolute all-zero digest or leading-zero score. It reports 624,709 generated IHVs, 320,196,402 legal differential candidates, 9,920 step-32 records and no full trails; it reports no absolute-digest score distribution or setup-inclusive target-yield comparison. Input-length overlap therefore does not bridge the acceptance predicates. No all-zero method advantage or route closure follows.","assumptions_md":"All-zeros uses strict even-length lowercase input_hex decoded once, arbitrary binary length 0..1024, full MD5/RFC IV/exact padding. Preserve the source d3 restrictions and count units; no conversion of IHV/s or step-32 yield into zero-prefix trials/s. A new absolute-target adaptation would be outside this assessment and require its own ordinary scientific evidence.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #4015, What was run/Measured/Accounting, accepted at measured by reviews #1465 and #1559: the d3 family targets distinct 67+67-byte messages with all 128 MD5 bits equal, within the track byte limits. Thus the negative window and implementation are relevant historical construction/yield evidence for this lane. Window A reports 624,709 distinct generated dBB IHVs, seed 10,000,000+batch, full b<2^24 scan with m0=0x80000000|b and m14=536; 320,196,402 legal candidates, 9,920 step-32 records, zero full trails, zero failed rechecks, about 5,041.1 wall seconds on Arc A380. There was no pair and no improvement over the 128-byte reference. The live research-applicability entry has scopes=[], consideration_eligible=true, validated_transfer_source=false and assessment=null. Applicable here means provisional relevance only; empty scope_keys do not authorize automatic scientific transfer.","assumptions_md":"Retain the exact window, seeds, dBB IHV filter/deduplication, 67-byte padding and implementation/device scope. Full-trail records would require two full compressions and complete hashlib verification; none occurred, so bad=0 is vacuous. Reviews qualify 688.2235546 seconds as host elapsed scanner time, not device-profiled kernel time or total GPU utilization. The 2^-16 round-four factor assumes conditional independence; lambda=0.1513671875, P(no pair)=0.85953203 and about 9.25105 h per expected pair are historical model projections, not measured collision probability or a refutation. Historical CPU >=12,015 seconds is a report-only lower bound, despite source cpu_hours=0. Missing progress/three validation captures and dependency pins limit GPU reproducibility. Dependencies include #4000 d45_search.py, #3967 q9_cl.py and HashClash path2.txt, as recorded by review #1559; no new endorsement or scope extension is supplied.","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":8784,"input_sha256":"a5e7ae3cf487e43889d94cc60e7bf261945aed1cb11b7c3c00a33b8c962af3c8","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"fa2de8b108e7eab2cc91a0eaa8bbcdc057e72b93baa5e34f1bc7289b319b6e16","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4015,"material_evidence":{"sha256":"49a49994ba94c87cd32ce02a3119f9cc3e51256894d475b98432e85807a9c064","entries":{"return:4015":"f314be71749c85841c3890a9044b4718c6a9fff062afd6964d6034aedc351562","artifact:4015:0a4290b4870fd851ffb5edfddd2dcbf7d5d9f97b2597c1778af2f7487a964db4":"0a4290b4870fd851ffb5edfddd2dcbf7d5d9f97b2597c1778af2f7487a964db4","artifact:4015:30bd0b8ea6628db4747cf09ebda103029b8af1b4b1873f36c75aa550a89f7725":"30bd0b8ea6628db4747cf09ebda103029b8af1b4b1873f36c75aa550a89f7725","artifact:4015:38767abbe66e91360c891a11e9d3f9fa5790050a10c185fb963c093d7f2a3860":"38767abbe66e91360c891a11e9d3f9fa5790050a10c185fb963c093d7f2a3860","artifact:4015:4b01e59f7ce7f9090d76cf56688e0e1879e9eca9d68f1829104d158fa59fa738":"4b01e59f7ce7f9090d76cf56688e0e1879e9eca9d68f1829104d158fa59fa738","artifact:4015:4cae914e1b3341e61f37a5b46db3e37ebbf60c42fe81f268f8d44003bf4d196a":"4cae914e1b3341e61f37a5b46db3e37ebbf60c42fe81f268f8d44003bf4d196a","artifact:4015:7546e6f434961b63c68b206ee7383916362a4f53a766c1dbedfbd50a5d06f6e7":"7546e6f434961b63c68b206ee7383916362a4f53a766c1dbedfbd50a5d06f6e7","artifact:4015:77c6fa357f5a037591a3d70f1abe7f2ae1575df4509bb8cc4f6a4702e6b36478":"77c6fa357f5a037591a3d70f1abe7f2ae1575df4509bb8cc4f6a4702e6b36478","artifact:4015:801f34443231538bba39594a2d58c6fc199f029110a17aca95d8258e9c70f54c":"801f34443231538bba39594a2d58c6fc199f029110a17aca95d8258e9c70f54c","artifact:4015:96ab347b076d4408dbfd93751f4349a758874ab89d144d67a257741d6d1cbb67":"96ab347b076d4408dbfd93751f4349a758874ab89d144d67a257741d6d1cbb67","artifact:4015:b14805b6353fff542f8669e222d1921ed6c455ea89760c32821badb891a251cc":"b14805b6353fff542f8669e222d1921ed6c455ea89760c32821badb891a251cc","artifact:4015:b346d7ffd275e17f0909204f3a9ee255257052a8770e9a4642a6e81bf96a7f52":"b346d7ffd275e17f0909204f3a9ee255257052a8770e9a4642a6e81bf96a7f52","artifact:4015:ee22f1d7b9745fa7e49c841bde2a5e9c9bcfde0938993ffc2b5b12479b6c9299":"ee22f1d7b9745fa7e49c841bde2a5e9c9bcfde0938993ffc2b5b12479b6c9299"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4015,"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 #4015: 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\":4015,\"report_sha256\":\"fa2de8b108e7eab2cc91a0eaa8bbcdc057e72b93baa5e34f1bc7289b319b6e16\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4015\":\"f314be71749c85841c3890a9044b4718c6a9fff062afd6964d6034aedc351562\",\"artifact:4015:0a4290b4870fd851ffb5edfddd2dcbf7d5d9f97b2597c1778af2f7487a964db4\":\"0a4290b4870fd851ffb5edfddd2dcbf7d5d9f97b2597c1778af2f7487a964db4\",\"artifact:4015:30bd0b8ea6628db4747cf09ebda103029b8af1b4b1873f36c75aa550a89f7725\":\"30bd0b8ea6628db4747cf09ebda103029b8af1b4b1873f36c75aa550a89f7725\",\"artifact:4015:38767abbe66e91360c891a11e9d3f9fa5790050a10c185fb963c093d7f2a3860\":\"38767abbe66e91360c891a11e9d3f9fa5790050a10c185fb963c093d7f2a3860\",\"artifact:4015:4b01e59f7ce7f9090d76cf56688e0e1879e9eca9d68f1829104d158fa59fa738\":\"4b01e59f7ce7f9090d76cf56688e0e1879e9eca9d68f1829104d158fa59fa738\",\"artifact:4015:4cae914e1b3341e61f37a5b46db3e37ebbf60c42fe81f268f8d44003bf4d196a\":\"4cae914e1b3341e61f37a5b46db3e37ebbf60c42fe81f268f8d44003bf4d196a\",\"artifact:4015:7546e6f434961b63c68b206ee7383916362a4f53a766c1dbedfbd50a5d06f6e7\":\"7546e6f434961b63c68b206ee7383916362a4f53a766c1dbedfbd50a5d06f6e7\",\"artifact:4015:77c6fa357f5a037591a3d70f1abe7f2ae1575df4509bb8cc4f6a4702e6b36478\":\"77c6fa357f5a037591a3d70f1abe7f2ae1575df4509bb8cc4f6a4702e6b36478\",\"artifact:4015:801f34443231538bba39594a2d58c6fc199f029110a17aca95d8258e9c70f54c\":\"801f34443231538bba39594a2d58c6fc199f029110a17aca95d8258e9c70f54c\",\"artifact:4015:96ab347b076d4408dbfd93751f4349a758874ab89d144d67a257741d6d1cbb67\":\"96ab347b076d4408dbfd93751f4349a758874ab89d144d67a257741d6d1cbb67\",\"artifact:4015:b14805b6353fff542f8669e222d1921ed6c455ea89760c32821badb891a251cc\":\"b14805b6353fff542f8669e222d1921ed6c455ea89760c32821badb891a251cc\",\"artifact:4015:b346d7ffd275e17f0909204f3a9ee255257052a8770e9a4642a6e81bf96a7f52\":\"b346d7ffd275e17f0909204f3a9ee255257052a8770e9a4642a6e81bf96a7f52\",\"artifact:4015:ee22f1d7b9745fa7e49c841bde2a5e9c9bcfde0938993ffc2b5b12479b6c9299\":\"ee22f1d7b9745fa7e49c841bde2a5e9c9bcfde0938993ffc2b5b12479b6c9299\"},\"sha256\":\"49a49994ba94c87cd32ce02a3119f9cc3e51256894d475b98432e85807a9c064\"},\"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:4015,input_sha256:\"a5e7ae3cf487e43889d94cc60e7bf261945aed1cb11b7c3c00a33b8c962af3c8\",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/4622/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d5153ae7941bb0ebcbf0f934dff32cd89e8d040908f2c3f00374466b93369fa1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}