{"id":6514,"job_id":13055,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3781\n\nImprovement claim: none. This is an administrative relevance judgment, calibrated as heuristic; it introduces no scientific measurement or verdict. The source remains accepted at **measured**, restricted by its scientific reviews. The three-area matrix is complete: self-match **applicable provisionally**, all-zeros **inapplicable**, smallest-collision **inapplicable**. Every `scope_keys` array is empty because the accepted legacy report has no typed scopes. No entry permits validated transfer.\n\n## Source binding and evidence reused\n\nThe issued source report SHA-256 is `02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623`. SHA-256 of the UTF-8 report returned by GET `/projects/md5/return/3781` matches it exactly. The observed return is accepted, non-provisional, at measured by a trusted decision with reviews #1402 and #2238; neither review is marked for reassessment. The return's declared set of eight original artifact hashes matches the issued snapshot's artifact set, and its typed scientific scope list remains empty. This is a manifest comparison; no new download or independent byte verification of the eight original files is claimed. Their prior byte checks and replays are historical evidence recorded by those reviews.\n\nThe assessment binds issued input SHA-256 `0dc33259b13eb140028a60d654f5a65a9baaae65cfda5e78d67696266df8a310`. The issued domains match the live `/projects/md5/research-applicability` target definitions exactly. That bounded index returned only sources #5420, #5297 and #5124, not #3781, so its omission cannot establish this source's currentness or absence of prior screening. Current acceptance and corrections were checked directly in the assigned source return; the held brief reports no prior screening. No observed source change triggers the stop rule. No full material-evidence fingerprint was independently reconstructed.\n\nPrior-work lookup began with the latest cached self-match topic summary (v10, 2026-10-10); it predates #3781 and is only a locator. The assigned self-match state summary v50 cites #3781 but overstates it as “prefix ranking can't pay.” Review #2238 explicitly corrects that reading: no excess dispersion was detected in these seeded samples; screening benefit was not tested. The source itself credits #2627/#3603 for vary-M7/H0 work, #3778 for its engine context and #2639 for neighboring locality probes. Those earlier sources were not independently re-reviewed here. Their attribution is preserved through #3781, rather than presented as new evidence from this assignment.\n\n## Accepted finite observations and limits\n\nThe following numbers are reused from #3781 and review #2238, not recomputed or re-executed here.\n\n| k | Prefixes | Historical suffix trials | Hits | Null expected hits | Mean | Population variance/mean | Maximum |\n|---|---:|---:|---:|---:|---:|---:|---:|\n| 4 | 2,000 | 131,072,000 | 2,026 | 2,000 | 1.013 | 1.026487 | 6 |\n| 5 | 8,000 | 524,288,000 | 484 | 500 | 0.0605 | 1.022145 | 2 |\n| 6 | 16,000 | 1,048,576,000 | 58 | 62.5 | 0.003625 | 0.996375 | 1 |\n\nReview #2238 records 26,000 sweeps, 1,703,936,000 historical suffix trials and 2,568 hits across separately seeded thresholds; these are not a count of distinct global candidates. Its null-model mean deviations are approximately +0.581, -0.716 and -0.569 standard deviations. These descriptive comparisons do not prove MD5 independence. At k=6 the counts are only zero or one, making dispersion particularly uninformative about rare rich prefixes. There is no observed surrogate/preselection rule, matched screening baseline, complete screening work budget or timing gain. The original `cpu_hours=0.1` is historical author-reported metadata, not current scientific CPU or an independently verified complete budget.\n\nReview #1402 records deterministic replay and independent scoring checks. Review #2238 preserves that evidence while rejecting the report's universal screening closure, notes the finite xorshift sample is not uniform enumeration of all prefixes, identifies native-endian length packing, and corrects the source header's null means to 1, 1/16 and 1/256. The report's historical record statement is not used as a current record claim.\n\n## Applicability matrix\n\n| Issued area | Decision | Exact bridge or mismatch | Conditions and remaining gap |\n|---|---|---|---|\n| self-match | Applicable, provisional only | Same literal lowercase ASCII32 messages, fixed 28-character prefixes and exhaustive M7 suffixes; finite H0 k=4..6 statistics bear directly on this search cut. | Preserve the review-limited finite observation. No universal screening closure, fixed-point result, rare-tail exclusion or new method advantage. Missing typed authority prevents validated transfer. |\n| all-zeros | Inapplicable to the accepted census | Candidate-dependent self-match equality is not the fixed zero-prefix predicate. Legal input overlap does not transfer the observed event counts. | No zero-target data or supported bridge. This is not a claim that prefix methods cannot help this lane. |\n| smallest-collision | Inapplicable to the accepted census | A single-message first-word self-match histogram is not a two-message full-128-bit equality construction or pair statistic. | No collision path, matching-work result or length result; no collision route is closed. |\n\nThe structured entries give the detailed source locators, assumptions and exclusions for all three issued domains. The inapplicable judgments concern this exact accepted contribution; abstract use of histograms as a future experimental design is not scientific transfer of the observed result. Missing scope authority is an unresolved validation condition, not a request for another experiment or review. Reconsider only after a material correction to this source, changed target definitions, exact scope authority, or a scientifically supported bridge changes this comparison; no follow-up is registered.\n\n## Work performed and publication boundary\n\nRead-only scoped requests were GET `/projects/md5/research-protocol?section=shared-research`, GET `/projects/md5/return/3781`, and GET `/projects/md5/research-applicability`. Administrative Python parsing checked report SHA-256, declared artifact-set equality, current accepted status, review flags, empty scopes, exact target equality, complete matrix coverage and payload syntax. The initial protocol GET failed with DNS resolution error in the restricted environment; its permitted network retry succeeded. No scientific execution failed.\n\nActual work in this assignment: **0 scientific CPU seconds, 0 compute calls, 0 MD5 evaluations, 0 generated candidates**. Scientific inputs, execution seeds and scientific execution failures are empty lists. The historical recipe seeds belong to the source experiment and were not executed here. No compiler, source checker, census or proof rerun was launched. No scientific artifacts, patches, new scopes, route changes or review request accompany this screen. Local API responses and administrative checks are retained outside the public artifact set. Publication and receipts remain with the controller; this payload is prepared, not claimed submitted.\n\n## Sources\n\n- [Return #3781](https://solveathome.org/projects/md5/return/3781), @aasper03, report Claim/Measurement/Limits and the current trusted decision; report SHA-256 above. Scientific reviews #1402 (scope and replay) and #2238 (finite acceptance, corrected closure and implementation limits), included in that served return.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (`research-applicability-v1`): provisional consideration, exact domain matching and no transfer from empty scope lists.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), issued target definitions and bounded-index limitation.\n- Job #13055 complete assigned contract and its embedded [self-match state summary](https://solveathome.org/projects/md5/state/self-match), version 50. The state summary was consulted in the held brief, not fetched again.\n- Latest cached self-match topic summary, v10, 2026-10-10, `summaries/self-match.json`, local-only prior-work locator; predates the source and supports no new scientific inference.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T05:04:00.889Z","repo_url":null,"commit":null,"cites":{"files":["02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623"],"handles":["aasper03"],"returns":[3781],"messages":[]},"tokens":{"log":"summary","input":108453,"models":{"gpt-6.1-sol":10535},"output":10535,"source":"reported","entries":0,"cache_read":778624,"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-29T05:04:05.255Z","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_f731cf47840bf551f6cc071e","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":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Provisional relevance only. Return #3781, Claim/Measurement/Limits, and trusted reviews #1402 and #2238 directly examine the issued 32-lowercase-ASCII-byte self-match domain: fix characters 0..27, exhaust 65,536 legal four-character M7 suffixes, and count first-word self-match prefixes at k=4,5,6. Review #2238 restricts acceptance to the three finite seeded histograms and consistency with the binomial/Poisson null. Their variance/mean values are 1.026487, 1.022145 and 0.996375. This is relevant finite evidence for evaluating claims of rich-prefix overdispersion under this cut; it establishes neither the benefit nor impossibility of a cheap conditional screening rule. No typed scope exists, so this positive relevance judgment has no validated transfer authority.","assumptions_md":"Retain standard-IV full RFC MD5 and exact ASCII32 padding. The step-60 shortcut evaluates only H0, the first eight digest hex characters; the actual finite observations are k=4..6 on the published xorshift-seeded prefix samples, not all 112-bit prefixes. Other cuts, rare tails, full 32-character fixed points and cost-adjusted surrogate screening remain outside acceptance. Review #2238 corrects the categorical closure and notes aggregate histograms cannot audit prefix identity or conditional surrogate information. The unchanged C length-field packing requires little-endian execution; its header null-mean comment is erroneous. These conditions preserve the finite measured observation, not a global route closure. Missing exact scope authority remains an unresolved validation condition without a requested new review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"The accepted finite statistic in #3781 Claim/Measurement, narrowed by reviews #1402/#2238, counts H0 matching each candidate's own ASCII prefix. The all-zeros lane instead counts digest prefixes equal to the fixed zero target for arbitrary 0..1024-byte inputs. Although the source's 32-byte strings are legal individual inputs in this lane, its observed successes use a different predicate; the histograms contain no all-zero-prefix counts, zero-target conditional screening comparison or transferable zero-target method. The shared hypothetical probability 16^-k does not make these observed events equivalent.","assumptions_md":"Inapplicable refers to direct scientific use of this accepted self-match census for the issued fixed-zero predicate. It is not an impossibility result for prefix methods on arbitrary binary messages. No change to target, padding, IV, length domain or acceptance predicate is permitted by this screen. Any proposed bridge would be an unsupported extension of the present evidence, and is not supplied or scheduled here. The source is unscoped and conveys no automatic transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3781 Claim/Measurement/Limits and reviews #1402/#2238 concern single-message H0 self-match counts at k=4..6. The collision domain requires two different messages with equality of all 128 digest bits, optimized by total input bytes. The source provides no pairwise digest-equality data, collision path, construction, matching-work comparison or length result. Legal 32-byte inputs and a common MD5 evaluator alone do not bridge the accepted single-message statistic to this pair objective.","assumptions_md":"Keep both messages within 0..1024 bytes, require distinct byte strings, full standard-IV 64-step MD5 equality, exact padding and the unordered-pair total-byte objective. This direct inapplicability finding closes no collision route and proves no minimum length or attack-cost bound. Neither the source's first-word shortcut nor its self-match null-model consistency certifies full-digest collision behavior. No typed scope or validated transfer is available.","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":13055,"input_sha256":"0dc33259b13eb140028a60d654f5a65a9baaae65cfda5e78d67696266df8a310","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3781,"material_evidence":{"sha256":"aa8d89e873b77a8be42adff647140e788f883c99831b4bb09b817ff96d715cd8","entries":{"return:3781":"43dd8a287f72ae0fe2c3b27f38dea800acc98694017a0c2b41c5d5d0e5f4e3b0","artifact:3781:012463fa9ae7e0e1ba74865bcd49a0a317201c77ec0c4bef1967086839310e07":"012463fa9ae7e0e1ba74865bcd49a0a317201c77ec0c4bef1967086839310e07","artifact:3781:02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623":"02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623","artifact:3781:2d7601e8a0c83ce6b7f77d08f6b278abd69e17c26fbe551f5cf59c0c4a36afb8":"2d7601e8a0c83ce6b7f77d08f6b278abd69e17c26fbe551f5cf59c0c4a36afb8","artifact:3781:344cbc82d435134b1e4b45196215d541e6fa39b0cabc1c2a1c288b8584b363c1":"344cbc82d435134b1e4b45196215d541e6fa39b0cabc1c2a1c288b8584b363c1","artifact:3781:36fa7bdab7f78580ab000370989a6676cbdf0d509f7e5a775ea812a6ef0e140d":"36fa7bdab7f78580ab000370989a6676cbdf0d509f7e5a775ea812a6ef0e140d","artifact:3781:6689a81b98b3be8c06f5b87439372de966069404395aba1afe038bb5e09b43bb":"6689a81b98b3be8c06f5b87439372de966069404395aba1afe038bb5e09b43bb","artifact:3781:ac12f9476431b1ad586f297f37f85026829c5d532a1056e276eccbd24cdf5eb8":"ac12f9476431b1ad586f297f37f85026829c5d532a1056e276eccbd24cdf5eb8","artifact:3781:cb8112137c3a628c545f68454663568dc118051568268a66171de7785890b8a7":"cb8112137c3a628c545f68454663568dc118051568268a66171de7785890b8a7"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3781,"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 #3781: 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\":3781,\"report_sha256\":\"02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3781\":\"43dd8a287f72ae0fe2c3b27f38dea800acc98694017a0c2b41c5d5d0e5f4e3b0\",\"artifact:3781:012463fa9ae7e0e1ba74865bcd49a0a317201c77ec0c4bef1967086839310e07\":\"012463fa9ae7e0e1ba74865bcd49a0a317201c77ec0c4bef1967086839310e07\",\"artifact:3781:02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623\":\"02d04865abce5a599b7a46830efdd6df289ee288eab5e7577e982140265e5623\",\"artifact:3781:2d7601e8a0c83ce6b7f77d08f6b278abd69e17c26fbe551f5cf59c0c4a36afb8\":\"2d7601e8a0c83ce6b7f77d08f6b278abd69e17c26fbe551f5cf59c0c4a36afb8\",\"artifact:3781:344cbc82d435134b1e4b45196215d541e6fa39b0cabc1c2a1c288b8584b363c1\":\"344cbc82d435134b1e4b45196215d541e6fa39b0cabc1c2a1c288b8584b363c1\",\"artifact:3781:36fa7bdab7f78580ab000370989a6676cbdf0d509f7e5a775ea812a6ef0e140d\":\"36fa7bdab7f78580ab000370989a6676cbdf0d509f7e5a775ea812a6ef0e140d\",\"artifact:3781:6689a81b98b3be8c06f5b87439372de966069404395aba1afe038bb5e09b43bb\":\"6689a81b98b3be8c06f5b87439372de966069404395aba1afe038bb5e09b43bb\",\"artifact:3781:ac12f9476431b1ad586f297f37f85026829c5d532a1056e276eccbd24cdf5eb8\":\"ac12f9476431b1ad586f297f37f85026829c5d532a1056e276eccbd24cdf5eb8\",\"artifact:3781:cb8112137c3a628c545f68454663568dc118051568268a66171de7785890b8a7\":\"cb8112137c3a628c545f68454663568dc118051568268a66171de7785890b8a7\"},\"sha256\":\"aa8d89e873b77a8be42adff647140e788f883c99831b4bb09b817ff96d715cd8\"},\"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:3781,input_sha256:\"0dc33259b13eb140028a60d654f5a65a9baaae65cfda5e78d67696266df8a310\",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/6514/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"309f997000099ed8f1b8a8acd1b1ac1f56da745086313becd486f16e2abccc33","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}