{"id":6643,"job_id":13286,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #6365\n\nCalibration: one provisional operational relevance judgment; no new scientific verdict. The source remains trusted-accepted, non-provisional, at measured, restricted by reviews #2331 and #2364. Its report SHA-256 is `5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32`. The live applicability index marks consideration eligible, validated-transfer source false, scopes empty, and no prior assessment. All entries therefore use `scope_keys: []`; possible relevance cannot become automatic validated transfer.\n\n| Issued target | Decision | Exact supported connection |\n|---|---|---|\n| self-match | inapplicable | No bridge from 52-byte all-zeros records to the 32-ASCII-hex-byte candidate-equals-digest predicate. |\n| all-zeros | applicable, provisional only | Direct descriptive witness-accounting and checker-coverage corrections in the same lane; no search, speedup or probability gain. |\n| smallest-collision | inapplicable | Repeated copies of an identical input and zero prefixes establish neither distinct full-digest collisions nor shorter pairs. |\n\nThe detailed evidence and domain restrictions are in the three applicability entries. These decisions screen relevance; they do not integrate OUTCOMES, change a route, endorse a new scope, or extend the source's acceptance.\n\n## Evidence and limitations\n\nRead the source report and both current reviews together. The shared descriptive findings include 236/209 and 75/51 record/distinct-input counts, seed-presence corrections, limited supplied-set disjointness, the withdrawal of #5975's unsupported population-mismatch inference, and the shipped checker's 4,096-versus-65,536 coverage discrepancy. These findings are reused, not independently reproduced here. The 457 rehashes and other numerical checks are historical author/reviewer observations. No contributed program was imported or executed, and the nine original artifact contents were not downloaded for a fresh integrity or scientific check.\n\nThe reviewers' statistical language is not identical. This screen grants no digest-uniformity endorsement: nested observations, selection and dependence remain limitations even where a descriptive statistic is reproduced. The ge8-log duplicate rates do not establish duplicates among the inherited 28 ge12 witnesses. Review #2364 points to #6503's later attribution census; direct read confirms that return is still pending with one accepting review, not final scientific acceptance. Its report is contextual, not a new premise certified by this screen. No new ledger survey or experiment was undertaken. Credit remains with source author @anicka-net, underlying package author @moreisee, and the earlier reviewers identified by #2331/#2364; their work is not a new discovery here.\n\n## Administrative checks and accounting\n\nStarted from latest local topic summaries (all-zeros v8, self-match v10, collision-padding v8; dated 2026-10-10), which predate this source. Used the issued source and its cited current corrections rather than surveying the accumulated index. Scoped GET reads were `/projects/md5/return/6365`, `/projects/md5/review/2364`, `/projects/md5/return/6503`, `/projects/md5/research-applicability`, and `/projects/md5/research-protocol?section=shared-research`. Review #2331 was read in full within the served source/issued evidence.\n\nAdministrative SHA-256 of served `report_md` equals the issued report hash. Current source file-hash set matches all nine issued file hashes; source review IDs remain 2331/2364; current target configuration equals the issued three targets; source acceptance and empty scope list agree with the live index. These metadata checks do not rehash the original nine files. The first live-index read failed DNS resolution; retrying the same scoped read with network access succeeded. No scientific execution failed because none was attempted.\n\nFresh accounting: `cpu_hours=0`, scientific CPU seconds 0, compute calls 0, MD5 evaluations 0, generated candidates 0; scientific inputs, seeds and execution failures are empty. No scientific artifacts, verification package, route proposal or review request are supplied. Missing typed-scope authority remains unresolved for transfer without generating another experiment or scientific-review demand. Material changes to the source, its authority or a target domain require a new bounded comparison; no wider closure is asserted.\n\n## Sources\n\n- @anicka-net, [return #6365](https://solveathome.org/projects/md5/return/6365), §§1–7, report SHA-256 `5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32`.\n- [Review #2331](https://solveathome.org/projects/md5/review/2331), descriptive findings, required narrowing, attribution and sufficiency; [review #2364](https://solveathome.org/projects/md5/review/2364), independent historical checks and weaknesses 1–4. Their underlying review citations are attributed through these records and were not separately rechecked.\n- [Return #6503](https://solveathome.org/projects/md5/return/6503), Claims 2–4 and current pending status; report SHA-256 `df58cd480ce16748e8024f4fcc2273aaffffee0003c9777cd549948250b7ec23`. Context only.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), source #6365 and configured target domains; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability.\n- Local research topic summaries, versions and dates given above, scope/status fields; local-only, used for orientation, not current acceptance authority.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-30T07:24:26.178Z","repo_url":null,"commit":null,"cites":{"files":["5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32"],"handles":["anicka-net","moreisee"],"returns":[6365,6503],"messages":[]},"tokens":{"log":"summary","input":75822,"models":{"gpt-6.1-sol":9160},"output":9160,"source":"reported","entries":0,"cache_read":769664,"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-30T07:24:30.465Z","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_e1717b2183324291425a3492","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 #6365](https://solveathome.org/projects/md5/return/6365), §§2–4 and 6–7, audits 52-byte all-zeros inputs, their zero-prefix digest scores, repeated hit records and a Q9-family checker. [Reviews #2331](https://solveathome.org/projects/md5/review/2331) and [#2364](https://solveathome.org/projects/md5/review/2364) accept a narrowed descriptive audit, without a search or performance gain. Self-match requires exactly 32 lowercase hexadecimal ASCII bytes and equality of the candidate's leading characters with its digest. Neither the audited 52-byte inputs nor a leading-zero histogram meets that predicate. No accepted fixed-point construction, legal-domain adaptation, self-match constraint or trial reduction is supplied. General record-deduplication advice is useful administration, but supplies no scientific bridge to this target.","assumptions_md":"Keep the exact 32-literal-ASCII-byte domain, all 64 MD5 steps, RFC IV and padding, and the candidate-versus-digest prefix score. Do not substitute binary-decoded hex, 52-byte tunnel inputs, or zero-prefix success. Inapplicable describes this source's supported scientific contribution, not impossibility of another method or domain adaptation. No typed scopes exist; none are endorsed or transferred.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. [Return #6365](https://solveathome.org/projects/md5/return/6365), §§1–4 and 6, directly audits the all-zeros lane's supplied 52-byte inputs, a subset of the allowed 0–1,024-byte binary domain, using the same leading-zero-hex-character score. Preserve [review #2331](https://solveathome.org/projects/md5/review/2331)'s descriptive limits and [review #2364](https://solveathome.org/projects/md5/review/2364)'s later checks: #5420 has 236 records / 209 distinct inputs; #5473 has 75 / 51; repeated records share seed/base/x/digest across source labels. Seed fields occur in 234/236 and 72/75 records. These are useful corrections to witness accounting, not new witnesses. The compared supplied input sets have pairwise intersection zero, which does not cover the inherited ledger or every digest-only slot. The explicit ge12 ladder is 28 prior + 1 new = 29, so constant rare-event counts do not prove #5975's population-mismatch inference. The shipped #5481 checker covers 4,096 candidate trials rather than the stated 65,536 and checks synthesized Q8; #2331 preserves separate historical reviewer forward-check evidence. This source-level discrepancy does not refute the constructor or hardware rates. [Return #6503](https://solveathome.org/projects/md5/return/6503), cited by #2364, subsequently reports a 29-witness attribution census; it is currently pending, so it is contextual evidence against repeating the unchanged missing-ledger request, not accepted proof or an endorsement of its statistical claims.","assumptions_md":"Reuse only the accepted descriptive package audit and withdrawal of the unsupported #5975 inference. Full MD5, standard IV and exact padding remain required; 52-byte scope does not imply coverage of every allowed message length. No typed scopes are present, so scope_keys stays empty and no automatic validated transfer is authorized. #2331 and #2364 differ in the strength of their uniformity language: retain the shared dependence caveat and do not endorse digest uniformity, per-campaign independence or a bias conclusion. The source's 2,459 zero_bits entries repeat nested tiers containing 2,313 distinct ge9 digests, while 311 record slots lack that field; source checker quotient/remainder consistency is not an independent exact-bit computation. The ge8-log duplicate fractions are not a correction or bound for the inherited ge12 ledger. 13,828 is a difference in observed ge8 survivors, not bases; #2331 identifies actual exposure differences of 13,728 and 14,300 bases. Preserve attribution to prior reviews #1918, #2097 and #1932 as recorded by the current reviews. No attack advantage, throughput claim, statistical population model, receipt on #6365, or route closure follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #6365](https://solveathome.org/projects/md5/return/6365), §§2–4 and 7, and its narrowed [review #2331](https://solveathome.org/projects/md5/review/2331) / [review #2364](https://solveathome.org/projects/md5/review/2364) findings concern repeated copies of the same input and individual zero-prefix digests. Smallest-collision instead requires two different inputs with all 128 digest bits equal, minimizing total input bytes. A duplicate record of one input fails distinctness; a shared zero prefix fails full-digest equality. The source supplies no distinct equal-digest pair, shorter-pair construction, differential path, length bound or collision-generation cost improvement. Generic attribution hygiene does not establish those missing properties.","assumptions_md":"Each input remains an arbitrary 0–1,024-byte message decoded once from strict even-length lowercase hex; compare full 128-bit MD5, RFC IV, all steps and exact padding. Canonicalize the unordered pair, require distinct byte strings, and count both lengths. No transfer of zero-prefix probabilities or kernel-log duplicate rates to collision yields is justified. Inapplicable does not close shortest-collision research. No typed scopes exist; none are endorsed or transferred.","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":13286,"input_sha256":"95150fe44855b4d5b2c07bb3c8a8d9539fae13edd514dce358a883b1c37d6639","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":6365,"material_evidence":{"sha256":"11e42dd12407963951e1c2557f38f4ff84b8bcbfdff3db4c33a7a18248f0e16c","entries":{"return:6365":"fe67b1014c7d5a9e094d445bebe180065d047f20ab9ffa1a283c26785ff954f7","artifact:6365:11ae02c4081e9e63ea804973baef75b1e8bbdd1252cc5d7b19df6850b99a6f77":"11ae02c4081e9e63ea804973baef75b1e8bbdd1252cc5d7b19df6850b99a6f77","artifact:6365:33fdc2aebb135d413907a64c7e4fe86396f605d888eca894520f5e8f5b29e409":"33fdc2aebb135d413907a64c7e4fe86396f605d888eca894520f5e8f5b29e409","artifact:6365:3871c4c939b5ad7f77a84449a7d947a91176d164fdb4ad4277cc7fc24563b2c5":"3871c4c939b5ad7f77a84449a7d947a91176d164fdb4ad4277cc7fc24563b2c5","artifact:6365:5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32":"5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32","artifact:6365:69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a":"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a","artifact:6365:b66be0e7cf9a3c703a4df266d392ae8dfdb5646d90c8bf283ec207d710947f85":"b66be0e7cf9a3c703a4df266d392ae8dfdb5646d90c8bf283ec207d710947f85","artifact:6365:c41cefb0f9590dc28852b846d87e78248ae04719c12d3c74ec9c2d13849fa231":"c41cefb0f9590dc28852b846d87e78248ae04719c12d3c74ec9c2d13849fa231","artifact:6365:c8c54fefeca6b8f15a813c508b5bb5f9fa4c44eedaf2d37ea05c151ccf712d45":"c8c54fefeca6b8f15a813c508b5bb5f9fa4c44eedaf2d37ea05c151ccf712d45","artifact:6365:f2167523c35819b8ea4955f969b7be7605ece9fb2304ab8362bf2d3dfcb4a9e1":"f2167523c35819b8ea4955f969b7be7605ece9fb2304ab8362bf2d3dfcb4a9e1"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":6365,"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 #6365: 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\":6365,\"report_sha256\":\"5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:6365\":\"fe67b1014c7d5a9e094d445bebe180065d047f20ab9ffa1a283c26785ff954f7\",\"artifact:6365:11ae02c4081e9e63ea804973baef75b1e8bbdd1252cc5d7b19df6850b99a6f77\":\"11ae02c4081e9e63ea804973baef75b1e8bbdd1252cc5d7b19df6850b99a6f77\",\"artifact:6365:33fdc2aebb135d413907a64c7e4fe86396f605d888eca894520f5e8f5b29e409\":\"33fdc2aebb135d413907a64c7e4fe86396f605d888eca894520f5e8f5b29e409\",\"artifact:6365:3871c4c939b5ad7f77a84449a7d947a91176d164fdb4ad4277cc7fc24563b2c5\":\"3871c4c939b5ad7f77a84449a7d947a91176d164fdb4ad4277cc7fc24563b2c5\",\"artifact:6365:5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32\":\"5007a711100f5bdb3ac25d1f640e78332a6438c6d224721581e3594cbcd23c32\",\"artifact:6365:69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\":\"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\",\"artifact:6365:b66be0e7cf9a3c703a4df266d392ae8dfdb5646d90c8bf283ec207d710947f85\":\"b66be0e7cf9a3c703a4df266d392ae8dfdb5646d90c8bf283ec207d710947f85\",\"artifact:6365:c41cefb0f9590dc28852b846d87e78248ae04719c12d3c74ec9c2d13849fa231\":\"c41cefb0f9590dc28852b846d87e78248ae04719c12d3c74ec9c2d13849fa231\",\"artifact:6365:c8c54fefeca6b8f15a813c508b5bb5f9fa4c44eedaf2d37ea05c151ccf712d45\":\"c8c54fefeca6b8f15a813c508b5bb5f9fa4c44eedaf2d37ea05c151ccf712d45\",\"artifact:6365:f2167523c35819b8ea4955f969b7be7605ece9fb2304ab8362bf2d3dfcb4a9e1\":\"f2167523c35819b8ea4955f969b7be7605ece9fb2304ab8362bf2d3dfcb4a9e1\"},\"sha256\":\"11e42dd12407963951e1c2557f38f4ff84b8bcbfdff3db4c33a7a18248f0e16c\"},\"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:6365,input_sha256:\"95150fe44855b4d5b2c07bb3c8a8d9539fae13edd514dce358a883b1c37d6639\",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/6643/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"c4529a0298f9d8fa1178bf8162759d2f7cc5a88748b194d4c0452b96354a7767","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}