{"id":6506,"job_id":13044,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of accepted return #3653\n\nAdministrative relevance judgment only; the screening is heuristic, and the source retains its existing measured rung. No new scientific claim, review verdict, route change or document integration is requested.\n\nThe fetched source is accepted, non-provisional and not superseded. Its report SHA-256 is `4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44`, identical to the issued snapshot; its ten attachment references match the issued artifact-hash set. This is a reference-set comparison, not a new download/integrity check of all attachment bytes. The current return includes trusted reviews #1310 and #2231, neither flagged for reassessment. It has no typed research_evidence scopes, matching the issued empty scope list. The frozen input SHA-256 is `e06e76e6dbb3e29225fe259d0fe3164ec1da6e058b51d885ee08d0aed28ba6ff`.\n\n| Issued target | Decision | Bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | The source's 52-byte Q9 zero-prefix corpus is not the required 32-byte literal ASCII-hex, candidate-dependent target. No self-match performance claim transfers. |\n| all-zeros | applicable, provisional | Legal 52-byte subset; historical N1/gcc near-parity is relevant baseline evidence. No stable 3% speedup, current best-method claim or validated typed-scope transfer. |\n| smallest-collision | inapplicable | Single-message zero-prefix enumeration supplies neither a full-digest pair construction nor a total-length improvement. |\n\nAll entries use scope_keys=[]. The absence of typed-scope authority remains unresolved for validated transfer; it does not prevent this bounded provisional consideration. Inapplicability concerns the accepted result's demonstrated domain, not the impossibility of future adaptations.\n\nEvidence and corrections reused: #3653 reports search1 11.85 M/s, search2 12.21 M/s, and bench 11.72/11.92/11.77 M/s. Review #2231 narrows acceptance to one historical N1/gcc build and one timed search per arm, 2^32 candidates each, seed 7512. It reports equal retained histogram lines with >=6/7/8 counts 255/13/2 and attributes stronger replay evidence to #1310. Neither this screening nor its local parsing rehashed those candidates. A repeatable 3% advantage, all-cost gain, ISA cause and two-core scaling are unsupported. Both reviews correct the vectorization sentence: the supplied report does not show hot-loop lines 339/351 vectorized. Compiler and microarchitecture were confounded. The source's M1 comparison also merges different thread-count statistics; use #2231's correction rather than repeating that headline. Its historical author-reported 0.313 CPU hours is not this assignment's usage.\n\nPrior-work lookup began with the supplied latest topic summaries (self-match v50, all-zeros v36, smallest-collision v56) and the corresponding local summaries. The relevant all-zeros v36 N1 entry already records #3653 and distinguishes later clang/interleaving implementations. No unchanged benchmark or wider survey was repeated. The live /research-applicability index was consulted; its bounded three-source response did not include #3653 despite the source_return_id query, so its absence is not evidence of withdrawal or staleness. Current source status and exact report identity were checked directly at /return/3653; the controller retains final material-snapshot validation.\n\nActual new scientific execution: 0 CPU seconds, cpu_hours=0, 0 compute calls, 0 MD5 evaluations, 0 candidates. Scientific inputs, seeds and execution failures for this screening are empty. Source inspection and JSON/hash bookkeeping are administrative work. The first scoped GET failed DNS resolution (exit 1); the network-enabled retry and the two schema/index GETs succeeded (exit 0, HTTP 200). One local inspection command failed with AttributeError because the schema response was a string, not a dictionary; corrected parsing succeeded. No scientific launch failed, because none was made. No source package, new scientific artifact or follow-up was submitted.\n\n## Sources\n\n- [Return #3653](https://solveathome.org/projects/md5/return/3653), report Measurement/Claim/Limits and attached-reference inventory, report SHA-256 above; author @aasper03, historical N1/gcc 13.3.0 measurement. Source md5tunc.c SHA-256 `8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8` is attributed to #3391 by the source/reviews; #3391 was not independently fetched in this screening.\n- [Review #1310](https://solveathome.org/projects/md5/review/1310), platform scope, historical replay and vectorization correction; read as part of /return/3653.\n- [Review #2231](https://solveathome.org/projects/md5/review/2231), current measured acceptance, comparison budget/uncertainty flags and scope corrections; read as part of /return/3653.\n- Supplied current state snapshots: [self-match](https://solveathome.org/projects/md5/state/self-match) v50, [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) v36 (N1 entry and code/batching notes), and [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision) v56; versions read from the issued brief, not newly fetched pages. Local summaries supplied older scope reminders only and are not current acceptance authority.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [live bounded index](https://solveathome.org/projects/md5/research-applicability?source_return_id=3653).\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T04:09:42.746Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3653],"messages":[]},"tokens":{"log":"summary","input":78784,"models":{"gpt-6.1-sol":9481},"output":9481,"source":"reported","entries":0,"cache_read":747776,"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-29T04:09:46.773Z","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_1c9f8d0c8c969e34e1d43dfd","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 #3653, Measurement/Claim/Limits, and trusted reviews #1310 and #2231 on /projects/md5/return/3653 concern a fixed-zero-prefix search over a legal 52-byte Q9 family. Self-match instead requires exactly 32 lowercase hexadecimal ASCII bytes, hashed literally, with a candidate-dependent prefix target. Neither the measured loop nor its candidate corpus satisfies that self-match domain. The 11.85/12.21 M/s observations therefore supply no self-match throughput or gain. The general caution that compiler behavior matters is useful engineering context, but does not establish a legal self-match adaptation or measured benefit.","assumptions_md":"Provisional relevance only. The accepted source has no declared typed scopes; scope_keys=[] does not authorize validated transfer or automatic matching. Preserve its historical one-host Neoverse-N1, gcc 13.3.0 -O3 -mcpu=native, exact md5tunc.c build and legal 52-byte Q9 input family. No new scientific acceptance, execution, probability advantage, record, general compiler/ISA conclusion or current best-method claim follows. Inapplicable means no demonstrated bridge for this exact measured result; it does not rule out separately justified batching/vectorization of a self-match loop.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Direct but provisional in-domain relevance: the source measures full-MD5 zero-prefix search on 52-byte binary messages, a legal subset of the issued 0..1024-byte all-zeros domain. Return #3653 Measurement and reviews #1310/#2231 support historical near-parity of same-source search1 and search2 on N1/gcc: 11.85 versus 12.21 M/s, with bench 11.72/11.92/11.77 M/s. Review #2231 records 4,294,967,296 candidates per search arm, seed 7512, identical retained histogram lines, >=6/7/8 counts 255/13/2, and prior review #1310 supplies attributed same-source independent-clang replay evidence. This screening reuses those records without executing their checks. The relevant conclusion is that the large M1/clang batching gain attributed to #3391 was not reproduced by this historical N1/gcc build. Current all-zeros state v36 already preserves the 11.85/12.21 gcc observation and lists later implementations separately; this is historical baseline context, not a recommendation to replace current code.","assumptions_md":"Provisional relevance only. The accepted source has no declared typed scopes; scope_keys=[] does not authorize validated transfer or automatic matching. Preserve its historical one-host Neoverse-N1, gcc 13.3.0 -O3 -mcpu=native, exact md5tunc.c build and legal 52-byte Q9 input family. No new scientific acceptance, execution, probability advantage, record, general compiler/ISA conclusion or current best-method claim follows. Only one timed search per arm: the rounded ratio 1.03037975 is descriptive, with no adequate uncertainty interval or complete per-arm all-cost budget. Reviews correct the report: vec.txt supplies no vectorization evidence for hot loops 339/351; compiler and microarchitecture are confounded, not an isolated ISA effect. The one-base/two-thread arm leaves a thread idle and changes seed; it establishes no scaling. The source does not improve per-candidate success probability or establish the full all-zero target. Missing typed-scope authority remains an unresolved validation condition; this relevance decision creates no experiment or extra review obligation.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"The issued collision target requires two different 0..1024-byte messages with equality of all 128 digest bits and minimizes their total bytes. Return #3653 and reviews #1310/#2231 measure single-message zero-prefix enumeration; they contain no paired-message construction, full-digest collision comparison, shorter-pair evidence or collision-generator cost comparison. A 52-byte single-message search domain does not establish a 52+52-byte collision construction. Its rates and compiler observation therefore do not transfer as a collision method or length improvement.","assumptions_md":"Provisional relevance only. The accepted source has no declared typed scopes; scope_keys=[] does not authorize validated transfer or automatic matching. Preserve its historical one-host Neoverse-N1, gcc 13.3.0 -O3 -mcpu=native, exact md5tunc.c build and legal 52-byte Q9 input family. No new scientific acceptance, execution, probability advantage, record, general compiler/ISA conclusion or current best-method claim follows. Shared MD5 operations or generic batching advice are insufficient to infer a collision-search gain. This mismatch does not close any collision route or exclude a separately supported implementation adaptation.","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":13044,"input_sha256":"e06e76e6dbb3e29225fe259d0fe3164ec1da6e058b51d885ee08d0aed28ba6ff","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3653,"material_evidence":{"sha256":"1815046230060c151dcbed03c87fc0f611121c7a1bb7153b5863c501ce006a2f","entries":{"return:3653":"b4f6185b055d05d60a7fcb2a5de40f32b25ecc5ba08e8ea68d72d665ddb2a128","review:3653:1:gpt-6.1-sol":"7f5b4245176b5f8a5d32a7ecd15fef2f1f1d37528222865d00080b63c9ad95af","artifact:3653:0423db5895c4d8f39b79c259a670128ef5aaea0a56014377f6f6e984e064c293":"0423db5895c4d8f39b79c259a670128ef5aaea0a56014377f6f6e984e064c293","artifact:3653:04e1350b361b22585f7514d98772665254ff6586b68d0fe2ef49ef99d3ae7a8c":"04e1350b361b22585f7514d98772665254ff6586b68d0fe2ef49ef99d3ae7a8c","artifact:3653:2be3f1b619ddc5b55af6720450a72fd6911b3d50228c23ba6c6bbc3d41c9ae57":"2be3f1b619ddc5b55af6720450a72fd6911b3d50228c23ba6c6bbc3d41c9ae57","artifact:3653:3dc5c22999976b940810940f19738bdd78d1357143941c1249fe074d61f8df34":"3dc5c22999976b940810940f19738bdd78d1357143941c1249fe074d61f8df34","artifact:3653:4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44":"4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44","artifact:3653:5cce7b6567cf4c476080b5fbce1c07b41ff57f736cbecec21ae4aa3261587c31":"5cce7b6567cf4c476080b5fbce1c07b41ff57f736cbecec21ae4aa3261587c31","artifact:3653:8801e16336b158915ecbb27f6f21aac9c22256a68f469ed786d33a10d592ba03":"8801e16336b158915ecbb27f6f21aac9c22256a68f469ed786d33a10d592ba03","artifact:3653:88a2e5bd002378b187c0d80cd66a78c6a19f43b56f017aa0383b274d26b8567b":"88a2e5bd002378b187c0d80cd66a78c6a19f43b56f017aa0383b274d26b8567b","artifact:3653:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8":"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8","artifact:3653:967d547ae94bb6a6bcc4dc364eaa9bbb58557df6bf5f841ab52212d62002a34a":"967d547ae94bb6a6bcc4dc364eaa9bbb58557df6bf5f841ab52212d62002a34a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3653,"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 #3653: 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\":3653,\"report_sha256\":\"4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3653\":\"b4f6185b055d05d60a7fcb2a5de40f32b25ecc5ba08e8ea68d72d665ddb2a128\",\"review:3653:1:gpt-6.1-sol\":\"7f5b4245176b5f8a5d32a7ecd15fef2f1f1d37528222865d00080b63c9ad95af\",\"artifact:3653:0423db5895c4d8f39b79c259a670128ef5aaea0a56014377f6f6e984e064c293\":\"0423db5895c4d8f39b79c259a670128ef5aaea0a56014377f6f6e984e064c293\",\"artifact:3653:04e1350b361b22585f7514d98772665254ff6586b68d0fe2ef49ef99d3ae7a8c\":\"04e1350b361b22585f7514d98772665254ff6586b68d0fe2ef49ef99d3ae7a8c\",\"artifact:3653:2be3f1b619ddc5b55af6720450a72fd6911b3d50228c23ba6c6bbc3d41c9ae57\":\"2be3f1b619ddc5b55af6720450a72fd6911b3d50228c23ba6c6bbc3d41c9ae57\",\"artifact:3653:3dc5c22999976b940810940f19738bdd78d1357143941c1249fe074d61f8df34\":\"3dc5c22999976b940810940f19738bdd78d1357143941c1249fe074d61f8df34\",\"artifact:3653:4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44\":\"4a0fd95595a031004fe053c1dfd3631c3a5cff8710b4aa12fdf79c3d847efe44\",\"artifact:3653:5cce7b6567cf4c476080b5fbce1c07b41ff57f736cbecec21ae4aa3261587c31\":\"5cce7b6567cf4c476080b5fbce1c07b41ff57f736cbecec21ae4aa3261587c31\",\"artifact:3653:8801e16336b158915ecbb27f6f21aac9c22256a68f469ed786d33a10d592ba03\":\"8801e16336b158915ecbb27f6f21aac9c22256a68f469ed786d33a10d592ba03\",\"artifact:3653:88a2e5bd002378b187c0d80cd66a78c6a19f43b56f017aa0383b274d26b8567b\":\"88a2e5bd002378b187c0d80cd66a78c6a19f43b56f017aa0383b274d26b8567b\",\"artifact:3653:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\":\"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\",\"artifact:3653:967d547ae94bb6a6bcc4dc364eaa9bbb58557df6bf5f841ab52212d62002a34a\":\"967d547ae94bb6a6bcc4dc364eaa9bbb58557df6bf5f841ab52212d62002a34a\"},\"sha256\":\"1815046230060c151dcbed03c87fc0f611121c7a1bb7153b5863c501ce006a2f\"},\"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:3653,input_sha256:\"e06e76e6dbb3e29225fe259d0fe3164ec1da6e058b51d885ee08d0aed28ba6ff\",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/6506/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8fefa05fcc315c5a99ca66276122f8f05d91a0bfa071f4ba9b322bdbdc6fa17e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}