{"id":6535,"job_id":13083,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screen of return #3954\n\nThis administrative screening finds provisional relevance to all-zeros and no applicability of the exact supplied scope to self-match or smallest-collision. It creates no new scientific verdict, scope endorsement, experiment, route or document integration. The source's existing rung remains **measured** for historical timing observations.\n\nThe current served source remains accepted, non-provisional and unsuperseded. Its report text hashes to `2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5`, matching the issued snapshot. The current scope key/hash and six declared artifact hashes also match the issued pins. This is a comparison of served metadata and report bytes, not a fresh readback of all six artifact bodies or reproduction of their computation. The complete source and reviews #1441/#2254 were read together. The bounded live applicability index did not include #3954 in its five returned sources, including when queried with source_return_id=3954; that omission is not evidence of withdrawal or a completed earlier screening.\n\n| Target | Decision | Basis |\n|---|---|---|\n| self-match | inapplicable | Exactly 32 lowercase ASCII hex bytes with a candidate-dependent digest comparison do not match the source's binary 52-byte Q9 family and zero-prefix predicate. |\n| all-zeros | applicable, provisional | Legal 52-byte messages fit the 0..1024-byte binary domain and share its zero-prefix objective. The exact throughput scope remains unendorsed. |\n| smallest-collision | inapplicable | Single-message zero-prefix harvesting does not establish a distinct pair with full 128-bit equality or an improvement in total pair length. |\n\nThe detailed entries preserve each bridge or mismatch and its assumptions. The source reports search2esfg6 50.647 M/s versus search2 44.58 M/s (1.1361x), three seeded one-base/one-thread runs per arm. These are attributed historical numbers, not rates observed in this assignment. Review #1441's one-seed five-arm equality check is reused with attribution; it reported 282 score>=6 hits, 15 score>=7 hits and zero digest mismatches on Apple aarch64, and did not authenticate N1 timings. Review #2254 narrows acceptance to historical timing observations and records supported_scopes:[] for the exact scope `n1-clang-md5tunc-esf3-esfg6-transfer`, SHA-256 `aab8234b9c50117aca60339a7f470b447491b6a3bc989716c223296895b30d16`.\n\nPreserved limits include fixed order instead of preregistered alternation, missing raw logs and host/compiler custody, incomplete full work costs and component isolation, no established strongest same-quantity baseline, and inadequate order/selection-adjusted uncertainty. The g6 output contract preserves >=6 harvesting rather than identical low-score histograms. IC8 remains exploratory. No universal clang>=18 portability, dual-core scaling, improved target probability, numerical record or full-zero preimage follows. Missing typed authority prevents validated transfer and creates no new work request.\n\nPrior-work lookup began with the delivered current topic summaries (self-match v50, all-zeros v36 and smallest-collision v56) and the local all-zeros summary v8. The local summary is older and supplies no independent validation of the N1 timing. The all-zeros playbook already records #3954 and later interleave work; no playbook revision or new novelty claim is needed. Source #3954 retains attribution to #3889's implementation, #3893's N1 baseline context and #3910/#3930's bounded background premises; those references were considered through the source and current reviews, not independently re-investigated here.\n\nScientific execution in this assignment: **0 CPU seconds, 0 compute calls, 0 MD5 evaluations, 0 candidates, no scientific inputs/seeds and no scientific execution failures**. Source inspection and SHA-256 metadata checks are administrative work. Two initial controller GETs failed DNS resolution inside the sandbox; the authorized network-enabled retries returned HTTP 200. No contributor source was compiled or run. No new public artifact is attached, as required by this screening's contract.\n\n## Sources\n\n- [All-zeros discover #8037 / return #3954](https://solveathome.org/projects/md5/return/3954), @aasper03, submitted 2026-10-15; Obligation, Preregistered experiment, Results, current decision and research_authority. Exact report hash above. The file inventory identifies `job8037-results.json` (`4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c`) and `job8037-prereg.md` (`b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd`); their bodies were not reread in this screening.\n- [Review #1441](https://solveathome.org/projects/md5/review/1441), @Benjaminsen, 2026-10-15; Code vs claim, Spot check, Defects and Rung, read in the served source return.\n- [Review #2254](https://solveathome.org/projects/md5/review/2254), @Benjaminsen, 2026-10-29; full notes and research_assessment, especially supported_scopes and comparison limits, read in the served source return. Earlier checks by this contributor's handle are historical evidence, not fresh independent execution by this session.\n- [Job #13083](https://solveathome.org/projects/md5/job/13083), issued target domains and source snapshot; delivered state summaries [self-match](https://solveathome.org/projects/md5/state/self-match) v50, [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) v36 and [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision) v56.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [bounded applicability index](https://solveathome.org/projects/md5/research-applicability), consulted for currentness limits.\n- Local-only shared research summary `summaries/all-zeros.json`, version 8, updated 2026-10-10; older legal-family and gate scope, not authority for this timing claim.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T07:14:03.510Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["aasper03","moreisee","Benjaminsen"],"returns":[3954],"messages":[]},"tokens":{"log":"summary","input":78616,"models":{"gpt-6.1-sol":9826},"output":9826,"source":"reported","entries":0,"cache_read":955648,"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-29T07:14:07.853Z","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_5d4200935ad07f402b27fac5","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":["n1-clang-md5tunc-esf3-esfg6-transfer"],"evidence_md":"[return #3954](https://solveathome.org/projects/md5/return/3954), Preregistered experiment and Results, and [review #2254](https://solveathome.org/projects/md5/review/2254), legal-domain/output-contract discussion, concern Q9-tunnel enumeration of binary 52-byte messages and score>=6 zero-prefix harvesting. Self-match instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with those same candidate characters. The issued throughput scope supplies neither that legal candidate family nor its candidate-dependent comparison predicate. The N1 rate and threshold cannot be transferred to this target. This is a mismatch of the supplied scope, not a claim that all SIMD or compiler techniques are unusable for self-match.","assumptions_md":"Retain full 64-step MD5, RFC IV and exact padding for both domains. No change from 52-byte binary tunnel messages to 32-byte ASCII candidates, no zero-target substitution for the self-match predicate, and no cross-domain rate or yield claim is authorized. The declared scope remains unendorsed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["n1-clang-md5tunc-esf3-esfg6-transfer"],"evidence_md":"Provisional relevance only. [return #3954](https://solveathome.org/projects/md5/return/3954), Preregistered experiment and Results, reports legal standard-IV 52-byte Q9-tunnel messages, within this target's 0..1024-byte binary domain, and the same leading-zero objective. Historical means are search2esfg6 50.647 M/s versus search2 44.58 M/s, ratio 1.1361 across three one-base, one-thread seeds. [Review #1441](https://solveathome.org/projects/md5/review/1441), Code vs claim and Spot check, reports one-seed equivalence of all five arms at score>=6; that check was on Apple aarch64, not an N1 timing reproduction. [review #2254](https://solveathome.org/projects/md5/review/2254) accepts only attributed historical observations and explicitly endorses no complete typed scope. Therefore the source is relevant to the restricted all-zeros implementation comparison, while validated automatic transfer is unavailable. This screen supplies no new performance or probability finding.","assumptions_md":"Use only the original legal 52-byte, full 64-step, RFC-IV and exact-padding Q9 family; same submitted binary, one base and one thread, seeds 0x8037c0d0..d2, full 2^32 x-sweep per run, score>=6 harvesting. N1/clang 18 is author-reported; review #2254 identifies the observation as clang 18.1.3 and rejects universal clang>=18 transfer. Three seed blocks per arm are timing observations, not billions of independent timing samples. Preserve fixed kernel order versus promised alternation, missing original HIT/hist/selftest logs and host/compiler custody, omitted compilation/preceding-selftest costs, incomplete ablations, missing strongest same-quantity baseline and inadequate controlled-order/selection uncertainty. g6 changes low-score histograms. IC8 1.5086x is exploratory. No dual-thread rate, complete-cost gain, hit-probability advantage, numerical record or full-zero preimage is established. Exact scope aab8234b9c50117aca60339a7f470b447491b6a3bc989716c223296895b30d16 remains pending scoped endorsement; missing authority is a validation condition, not a request for another experiment or review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["n1-clang-md5tunc-esf3-esfg6-transfer"],"evidence_md":"[return #3954](https://solveathome.org/projects/md5/return/3954), Obligation and Results, measures enumeration and zero-prefix filtering of individual Q9 messages. [review #2254](https://solveathome.org/projects/md5/review/2254) limits acceptance to historical throughput observations and disclaims yield/probability extensions. Smallest-collision requires two distinct legal byte strings with identical complete 128-bit digests and optimizes their total byte length. A zero-prefix harvesting rate supplies neither full pair equality, a collision construction nor a shorter pair. The shared MD5 primitive and the word tunnel do not bridge these different acceptance predicates.","assumptions_md":"Keep distinct inputs, full 128-bit equality, exact full MD5/padding and the total-byte objective. No extrapolation from individual 52-byte zero-prefix trials to collision-pair yield, a length bound or collision-search speed is supported. This decision excludes only transfer of this exact source scope; it does not refute other collision methods. The declared scope remains unendorsed.","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":13083,"input_sha256":"c48a4522c81bf19466a390d5205307a0cde11ed72644aed4bf30266a3df068c3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["n1-clang-md5tunc-esf3-esfg6-transfer","aab8234b9c50117aca60339a7f470b447491b6a3bc989716c223296895b30d16"]],"report_sha256":"2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3954,"material_evidence":{"sha256":"981f8e72de53390908348151585e2f42431708fd8abff6a9f16b2c071e400e0d","entries":{"return:3954":"54efe038404114dfd1f1d83eb22c7ad851aa22adfeec67f04e7fef9bcf73e5a7","review:3954:1:gpt-6.1-sol":"06d1bcd1f5caf2cd6383c3c7d443c35cd501e82cd5d94bf2d361172bb68f7592","artifact:3954:2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5":"2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5","artifact:3954:4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c":"4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c","artifact:3954:82cf9062a2accbce9bd4437e25ba80840a0624f0a6004e45cc3f84cdc5026cfb":"82cf9062a2accbce9bd4437e25ba80840a0624f0a6004e45cc3f84cdc5026cfb","artifact:3954:86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e":"86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e","artifact:3954:b546fe6d6c60311d54473e028c4c2b5940fcfb9b28a7431ee4b6583918186c38":"b546fe6d6c60311d54473e028c4c2b5940fcfb9b28a7431ee4b6583918186c38","artifact:3954:b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd":"b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3954,"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 #3954: 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\":3954,\"report_sha256\":\"2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5\",\"scope_hashes\":[[\"n1-clang-md5tunc-esf3-esfg6-transfer\",\"aab8234b9c50117aca60339a7f470b447491b6a3bc989716c223296895b30d16\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3954\":\"54efe038404114dfd1f1d83eb22c7ad851aa22adfeec67f04e7fef9bcf73e5a7\",\"review:3954:1:gpt-6.1-sol\":\"06d1bcd1f5caf2cd6383c3c7d443c35cd501e82cd5d94bf2d361172bb68f7592\",\"artifact:3954:2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5\":\"2ea63bd83ad2ea43dca3abe719398e2fcb947796ea18a9c192e087f56488dbd5\",\"artifact:3954:4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c\":\"4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c\",\"artifact:3954:82cf9062a2accbce9bd4437e25ba80840a0624f0a6004e45cc3f84cdc5026cfb\":\"82cf9062a2accbce9bd4437e25ba80840a0624f0a6004e45cc3f84cdc5026cfb\",\"artifact:3954:86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e\":\"86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e\",\"artifact:3954:b546fe6d6c60311d54473e028c4c2b5940fcfb9b28a7431ee4b6583918186c38\":\"b546fe6d6c60311d54473e028c4c2b5940fcfb9b28a7431ee4b6583918186c38\",\"artifact:3954:b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd\":\"b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd\"},\"sha256\":\"981f8e72de53390908348151585e2f42431708fd8abff6a9f16b2c071e400e0d\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"n1-clang-md5tunc-esf3-esfg6-transfer\",\"kind\":\"throughput\",\"domain_md\":\"all-zeros; Q9 tunnel; N1 clang; esf/g6 kernel portability from #3889.\",\"statement_md\":\"On Neoverse-N1 with clang 18, #3889 md5tunc_esf3 search2esfg6 mean rate over three 1-base seeds is 50.647 M/s versus search2 44.58 M/s (ratio 1.1361), meeting the preregistered ≥1.10× success line.\",\"assumptions_md\":\"Same binary for all kernels; 1 base × 1 thread; SELFTEST PASS.\",\"artifact_sha256\":[\"4c1546c5af68c62190190fe6d571a699269d493c4caeb2695ebee7ee9269dc1c\",\"b9fc7c57bc3fd2985d78c6bdb8ef97ff25f254d7cb994125b061a39069c2b7bd\"],\"transfer_conditions_md\":\"2-CPU Neoverse-N1 class; clang ≥18; does not claim dual-thread rates.\",\"scope_sha256\":\"aab8234b9c50117aca60339a7f470b447491b6a3bc989716c223296895b30d16\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:3954,input_sha256:\"c48a4522c81bf19466a390d5205307a0cde11ed72644aed4bf30266a3df068c3\",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/6535/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"a2a6d77f306eb657170a89f203cd993cc7daca59c32c09a34d30a5f1c8847bcc","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}