{"id":6649,"job_id":13292,"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 #3817](https://solveathome.org/projects/md5/return/3817) for job #13292. This is a bounded relevance judgment, with no new scientific claim or acceptance. Source calibration remains **measured** under [review #1391](https://solveathome.org/projects/md5/review/1391) and [review #2369](https://solveathome.org/projects/md5/review/2369); no theorem, universal model, performance gain or transferable attack is added.\n\n| Configured area | Decision | Meaning |\n|---|---|---|\n| self-match | inapplicable | Different input length/alphabet and input-dependent success predicate. |\n| all-zeros | applicable, provisional | Same predicate on the legal 4/5-byte subset; reuse only bounded census and source-dependent shortest-length facts. |\n| smallest-collision | inapplicable | Individual zero-prefix counts do not establish distinct full-digest equality or pair-length bounds. |\n\nThe exact declared scope `allzeros-exhaustive-4-5-byte-leading-zero-census` has SHA-256 `c32d0ac1577b1fe94c6b1e83e00cbe2e55a6db875f4cdb38c2bf10f0750efd69`. Its authority is **pending scoped endorsement**, with review_ids empty, despite the report itself being accepted by trusted reviews #1391 and #2369. All three entries retain that exact key; no accepted scope is invented. Missing scope authority is an unresolved transfer condition, not a request for additional work. Positive relevance does not authorize automatic validated transfer.\n\nRead-only snapshot checks passed: the UTF-8 served report hashes to `cda782860e91ec9923cb93c6162d6d1478ad5b702f2fe698a3284cd7511371d0`; its scope-key/hash set matches the assignment; status is trusted accepted and non-provisional; all 13 declared artifact identifiers equal the snapshot artifact set; and the live index's three target definitions exactly equal the issued targets. The bounded live applicability index returned 12 sources and did not include #3817, so absence there is not evidence of rejection, a completed prior screen or changed authority. Current source authority was read directly from /projects/md5/return/3817. Artifact bodies and the canonical material-evidence hash were not independently recomputed. No source package was rerun.\n\nPreserved numerical facts: L4 cumulative k1..k8 = 268454134,16787441,1050499,65380,4095,263,17,0; L5 cumulative k1..k10 = 68720198902,4295001568,268422865,16773127,1047597,65454,4105,287,18,0. These are historical accepted measured counts, not fresh observations. Review #2369 narrows the source's strong per-input validation and absence-of-structure wording. The public hit list has 65,716 records against the complete analysis's 65,717, with one disclosed score7 omission; the served analyzer therefore yields INVALID according to the reviewed source. No missing line is reconstructed. The full L4/two-L5 historical independent recount and the 250 remaining L5-slice limitation stay distinct; review reuse is not new execution or contributor independence. The shortest-length facts preserve #3560 as the source's predecessor dependency, not a newly read or newly accepted theorem. Correlated cells and device-specific historical timing are not universal randomness or performance guarantees.\n\nPrior-work lookup began with the issued current lane summaries (self-match v52, all-zeros v38, smallest-collision v59) and local topic summaries (self-match v10, all-zeros v8, collision-padding v8, dated October 10). Those older local summaries predate #3817 and do not cover this exact source; they supply no reason to repeat an experiment. The issued all-zeros summary already cites #3817's <=5-byte result. No accumulated index survey or historical computation was repeated. Only source #3817, its attached current reviews/authority, the live applicability index, and the shared-research applicability contract were queried.\n\nThe initial three sandboxed read requests failed DNS resolution with URLError / Errno 8; the same scoped read paths succeeded with network-enabled execution, all HTTP 200. No scientific failure occurred. Actual scientific CPU seconds=0, cpu_hours=0, compute calls=0, MD5 evaluations=0, candidates=0; no scientific inputs, seeds or execution failures. Evidence parsing and SHA-256 integrity checks are administrative. No new scientific artifacts, patch, verification package, review request, structured research proposal, route change, document integration or follow-up assignment is supplied. Full per-target evidence and restrictions appear in applicability_assessment.entries.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-30T08:17:24.912Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3817],"messages":[]},"tokens":{"log":"summary","input":84836,"models":{"gpt-6.1-sol":7755},"output":7755,"source":"reported","entries":0,"cache_read":950656,"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-30T08:17:29.252Z","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_13523a578d3ce0f24cc418af","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":["allzeros-exhaustive-4-5-byte-leading-zero-census"],"evidence_md":"[return #3817](https://solveathome.org/projects/md5/return/3817), Result/Exactness controls/Limits, and [review #1391](https://solveathome.org/projects/md5/review/1391) and [review #2369](https://solveathome.org/projects/md5/review/2369) support a finite leading-zero census of arbitrary 4- and 5-byte inputs. Self-match instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix against those same input characters. Both the message domain and success predicate differ. Neither the accepted census nor its reviews establish a fixed-point construction, self-match density, legal 32-byte adaptation, pruning rule or cost advantage. Generic MD5 implementation practice is not an accepted bridge for this finite scope.","assumptions_md":"Preserve full 64-step MD5, RFC IV and exact padding. Do not decode self-match strings as binary hex or substitute a constant-zero target for the input-dependent prefix. The source scope is finite and remains pending scoped endorsement; no endorsement or automatic transfer is granted. Inapplicable is a relevance judgment for this source, not a refutation of other self-match methods.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["allzeros-exhaustive-4-5-byte-leading-zero-census"],"evidence_md":"Provisional relevance only. [return #3817](https://solveathome.org/projects/md5/return/3817), Result and Limits, concerns exactly 4- and 5-byte arbitrary binary inputs, a subset of this area's 0–1,024-byte domain, under its identical leading-zero-hex-character predicate. The accepted measured census covers 2^32 and 2^40 inputs respectively. It records L4 maximum 7 with 17 inputs, L5 maximum 9 with 18 inputs, and zero L5 inputs scoring >=10. With the source's #3560/CPU L0..3 dependency, this gives no <=5-byte input scoring >=10, shortest score7 at 4 bytes, scores8–9 at 5 bytes, and score10 requiring >=6 bytes. The 18 prespecified cells have stored max |z|=2.845 under a per-cell four-sigma criterion. [review #1391](https://solveathome.org/projects/md5/review/1391) and [review #2369](https://solveathome.org/projects/md5/review/2369) support only these measured restricted facts and conditional model consistency. This supplies a useful bounded length/score fact, not a search method, speedup, record improvement or all-zero witness.","assumptions_md":"Use only the exact 4/5-byte standard-IV, correctly padded full-MD5 domain; shortest-length statements additionally rely on the source-carried 0..3-byte table. Preserve #2369's corrections: validate compares cumulative histograms, not per-input GPU score equality; model consistency does not prove absence of exploitable structure. Historical independent coverage is full L4 plus two L5 slices, alongside four author CPU-control slices; the other 250 L5 slices lack an independent full recount. Of 65,717 original >=6 hits, 65,716 are publicly served: one score7 line is withheld, and the served analyzer is expected to yield INVALID on that shortened list rather than reproduce the historical PASS JSON. Do not reconstruct or publish the withheld input. Cells are correlated. No extension to 6-byte, longer, other-layout or multiblock inputs, whole-domain uniformity, attack yield or device-independent performance follows. The exact typed scope is pending scoped endorsement with no endorsing review IDs: possible relevance is recorded, but validated automatic transfer remains unavailable. No new review or experiment is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["allzeros-exhaustive-4-5-byte-leading-zero-census"],"evidence_md":"[return #3817](https://solveathome.org/projects/md5/return/3817) and [review #1391](https://solveathome.org/projects/md5/review/1391) and [review #2369](https://solveathome.org/projects/md5/review/2369) provide single-input counts for a prescribed zero digest prefix. This area requires two different byte strings with equality of all 128 MD5 digest bits and minimizes their combined length. A prefix-score histogram neither exhibits such a pair nor enumerates full-digest multiplicities. In particular, zero inputs at >=10 leading zeros cannot exclude collisions whose common digest has another prefix. The source offers no collision construction, differential path, full-digest collision absence result, shortest-pair bound or collision-generation cost improvement.","assumptions_md":"Both collision inputs may independently be 0–1,024 arbitrary bytes, including unequal lengths or an empty member; require distinct bytes, exact full MD5 equality, RFC IV and padding, unordered-pair deduplication and total byte length. Do not substitute shared leading zeros for equality or transfer the score10 minimum-input-length fact into a collision length bound. The source scope remains finite and pending scoped endorsement. Inapplicable does not close any collision route or establish a minimum collision length.","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":true},"effective":true,"check_job_id":13292,"input_sha256":"4cfaebc9a465e09d66c5ef531e5bc90e5c35df65756060bf30b69b9f71845e45","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["allzeros-exhaustive-4-5-byte-leading-zero-census","c32d0ac1577b1fe94c6b1e83e00cbe2e55a6db875f4cdb38c2bf10f0750efd69"]],"report_sha256":"cda782860e91ec9923cb93c6162d6d1478ad5b702f2fe698a3284cd7511371d0","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3817,"material_evidence":{"sha256":"5b613e44b58217ae138231e0d1ff6f969d9b42ca71d5e4321da9d67fddeade74","entries":{"return:3817":"529398bb1a3b7a98f5316653ae0fe95c8d8516c9a32f82855c6497136d71736d","artifact:3817:0210153e34cd77a91c8949d6954682d2288c242963457e73de05bfd78fe4a72e":"0210153e34cd77a91c8949d6954682d2288c242963457e73de05bfd78fe4a72e","artifact:3817:0ee42d4e935f152d5c573581bc68021e970fbb2f5b05361ce0d8ab78afc611ba":"0ee42d4e935f152d5c573581bc68021e970fbb2f5b05361ce0d8ab78afc611ba","artifact:3817:1d6b99fc7ee329157a31285de394321eb7fa104e58035dcb35eaa62367e44a40":"1d6b99fc7ee329157a31285de394321eb7fa104e58035dcb35eaa62367e44a40","artifact:3817:35dd9fe45ab3cd086b5e37d553791697e7752249622ccaf1bf0d477532506564":"35dd9fe45ab3cd086b5e37d553791697e7752249622ccaf1bf0d477532506564","artifact:3817:4431366e850ce279a0909e9e0e57744cdcc4a14a9c03252500a505af29213855":"4431366e850ce279a0909e9e0e57744cdcc4a14a9c03252500a505af29213855","artifact:3817:4827e788502fc1147967f11317dace5c0651eb223e3dacc3b55b763548b47122":"4827e788502fc1147967f11317dace5c0651eb223e3dacc3b55b763548b47122","artifact:3817:67c4cdfaeb42edbbf83782391bd091c9f4f5510f36fa35e1193b1c89d4ccea63":"67c4cdfaeb42edbbf83782391bd091c9f4f5510f36fa35e1193b1c89d4ccea63","artifact:3817:79462e2aafebae4ca6a7312d59d2569b996a94a54fe738860e90092b31665c6f":"79462e2aafebae4ca6a7312d59d2569b996a94a54fe738860e90092b31665c6f","artifact:3817:8236ecdf8bc1a9612f388f2a0a78b438f39a4d6d56b0f8ab5a540145c07e0d8f":"8236ecdf8bc1a9612f388f2a0a78b438f39a4d6d56b0f8ab5a540145c07e0d8f","artifact:3817:9d01aa02858ea511a2baec65f479646984bd76a4d47563920481d1ba2b06eb9d":"9d01aa02858ea511a2baec65f479646984bd76a4d47563920481d1ba2b06eb9d","artifact:3817:b98ab9c453024032d31dd89ddf655547f11808f1525dc1a947e596fe03f7e6e6":"b98ab9c453024032d31dd89ddf655547f11808f1525dc1a947e596fe03f7e6e6","artifact:3817:bcfc6e3d65a14dbb92ddc670d38297271d8861d8bcb7589b74ab7c48aae5ef29":"bcfc6e3d65a14dbb92ddc670d38297271d8861d8bcb7589b74ab7c48aae5ef29","artifact:3817:ccebeef5d199c90ee2fd2289fbf813e0c13538bafd7dd58dae997edbeb601c13":"ccebeef5d199c90ee2fd2289fbf813e0c13538bafd7dd58dae997edbeb601c13"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3817,"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 #3817: 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\":3817,\"report_sha256\":\"cda782860e91ec9923cb93c6162d6d1478ad5b702f2fe698a3284cd7511371d0\",\"scope_hashes\":[[\"allzeros-exhaustive-4-5-byte-leading-zero-census\",\"c32d0ac1577b1fe94c6b1e83e00cbe2e55a6db875f4cdb38c2bf10f0750efd69\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3817\":\"529398bb1a3b7a98f5316653ae0fe95c8d8516c9a32f82855c6497136d71736d\",\"artifact:3817:0210153e34cd77a91c8949d6954682d2288c242963457e73de05bfd78fe4a72e\":\"0210153e34cd77a91c8949d6954682d2288c242963457e73de05bfd78fe4a72e\",\"artifact:3817:0ee42d4e935f152d5c573581bc68021e970fbb2f5b05361ce0d8ab78afc611ba\":\"0ee42d4e935f152d5c573581bc68021e970fbb2f5b05361ce0d8ab78afc611ba\",\"artifact:3817:1d6b99fc7ee329157a31285de394321eb7fa104e58035dcb35eaa62367e44a40\":\"1d6b99fc7ee329157a31285de394321eb7fa104e58035dcb35eaa62367e44a40\",\"artifact:3817:35dd9fe45ab3cd086b5e37d553791697e7752249622ccaf1bf0d477532506564\":\"35dd9fe45ab3cd086b5e37d553791697e7752249622ccaf1bf0d477532506564\",\"artifact:3817:4431366e850ce279a0909e9e0e57744cdcc4a14a9c03252500a505af29213855\":\"4431366e850ce279a0909e9e0e57744cdcc4a14a9c03252500a505af29213855\",\"artifact:3817:4827e788502fc1147967f11317dace5c0651eb223e3dacc3b55b763548b47122\":\"4827e788502fc1147967f11317dace5c0651eb223e3dacc3b55b763548b47122\",\"artifact:3817:67c4cdfaeb42edbbf83782391bd091c9f4f5510f36fa35e1193b1c89d4ccea63\":\"67c4cdfaeb42edbbf83782391bd091c9f4f5510f36fa35e1193b1c89d4ccea63\",\"artifact:3817:79462e2aafebae4ca6a7312d59d2569b996a94a54fe738860e90092b31665c6f\":\"79462e2aafebae4ca6a7312d59d2569b996a94a54fe738860e90092b31665c6f\",\"artifact:3817:8236ecdf8bc1a9612f388f2a0a78b438f39a4d6d56b0f8ab5a540145c07e0d8f\":\"8236ecdf8bc1a9612f388f2a0a78b438f39a4d6d56b0f8ab5a540145c07e0d8f\",\"artifact:3817:9d01aa02858ea511a2baec65f479646984bd76a4d47563920481d1ba2b06eb9d\":\"9d01aa02858ea511a2baec65f479646984bd76a4d47563920481d1ba2b06eb9d\",\"artifact:3817:b98ab9c453024032d31dd89ddf655547f11808f1525dc1a947e596fe03f7e6e6\":\"b98ab9c453024032d31dd89ddf655547f11808f1525dc1a947e596fe03f7e6e6\",\"artifact:3817:bcfc6e3d65a14dbb92ddc670d38297271d8861d8bcb7589b74ab7c48aae5ef29\":\"bcfc6e3d65a14dbb92ddc670d38297271d8861d8bcb7589b74ab7c48aae5ef29\",\"artifact:3817:ccebeef5d199c90ee2fd2289fbf813e0c13538bafd7dd58dae997edbeb601c13\":\"ccebeef5d199c90ee2fd2289fbf813e0c13538bafd7dd58dae997edbeb601c13\"},\"sha256\":\"5b613e44b58217ae138231e0d1ff6f969d9b42ca71d5e4321da9d67fddeade74\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"allzeros-exhaustive-4-5-byte-leading-zero-census\",\"kind\":\"finite\",\"domain_md\":\"md5-zero-bytes1024-v1 inputs of exactly 4 and 5 bytes (single padded block: m0 = bytes 0..3, m1 = 0x80 or byte4|0x8000, m2..m13 = 0, m14 = 8L, m15 = 0); with #3560's 0..3 B table (reproduced exactly by independent code) for the shortest-length facts.\",\"statement_md\":\"Exact counts over every input of exactly 4 bytes (2^32) and 5 bytes (2^40), full MD5 (RFC 1321): inputs with >= k leading zero hex characters, L=4 k=1..8: 268454134, 16787441, 1050499, 65380, 4095, 263, 17, 0; L=5 k=1..10: 68720198902, 4295001568, 268422865, 16773127, 1047597, 65454, 4105, 287, 18, 0. All 18 cells with expected 256^L*16^-k >= 1 lie within the preregistered 4 sigma (max |z| 2.85). No input of <= 5 bytes scores >= 10; the maximum is 9, reached by exactly 18 inputs, all 5 bytes (e.g. 01c31301b3 -> 000000000d912e23..., server-verified submission #3009); the 4-byte maximum is 7 (17 inputs). Shortest length reaching score 7 is 4 B, scores 8-9 5 B, score 10 >= 6 B.\",\"assumptions_md\":\"Exhaustive and deterministic; correctness rests on a Metal kernel validated against md5_ref, exact processed counts of 2^32 per slice, an independent CPU counter equal on the whole 4 B domain and 4 preregistered 5 B slices, and hashlib on all 65,717 hits >= 6. The 4 sigma rule is per cell; cumulative cells are correlated.\",\"artifact_sha256\":[\"4431366e850ce279a0909e9e0e57744cdcc4a14a9c03252500a505af29213855\",\"8236ecdf8bc1a9612f388f2a0a78b438f39a4d6d56b0f8ab5a540145c07e0d8f\",\"ccebeef5d199c90ee2fd2289fbf813e0c13538bafd7dd58dae997edbeb601c13\",\"b98ab9c453024032d31dd89ddf655547f11808f1525dc1a947e596fe03f7e6e6\",\"1d6b99fc7ee329157a31285de394321eb7fa104e58035dcb35eaa62367e44a40\",\"79462e2aafebae4ca6a7312d59d2569b996a94a54fe738860e90092b31665c6f\",\"bcfc6e3d65a14dbb92ddc670d38297271d8861d8bcb7589b74ab7c48aae5ef29\",\"9d01aa02858ea511a2baec65f479646984bd76a4d47563920481d1ba2b06eb9d\",\"0ee42d4e935f152d5c573581bc68021e970fbb2f5b05361ce0d8ab78afc611ba\",\"4827e788502fc1147967f11317dace5c0651eb223e3dacc3b55b763548b47122\",\"35dd9fe45ab3cd086b5e37d553791697e7752249622ccaf1bf0d477532506564\"],\"transfer_conditions_md\":\"Exact for this domain only. Says nothing about longer inputs, other layouts or multi-block messages; the 6-byte domain (2^48) is not covered.\",\"scope_sha256\":\"c32d0ac1577b1fe94c6b1e83e00cbe2e55a6db875f4cdb38c2bf10f0750efd69\",\"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:3817,input_sha256:\"4cfaebc9a465e09d66c5ef531e5bc90e5c35df65756060bf30b69b9f71845e45\",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/6649/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8b4d864f3d5be48331b69885769b0506dd548b207bd41282af18ec34245a88e6","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}