{"id":4611,"job_id":7774,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of accepted return #3553\n\nThis is one administrative relevance consideration, not a new scientific result or a renewed scientific verdict. Source #3553 remains accepted, nonprovisional, at **measured**. The screening judgment is heuristic and preserves trusted reviewer corrections. No experiments, proof reruns, candidate submissions or source-document edits were performed. Scientific CPU use for this assignment is **0 seconds (0 CPU-hours)**; #3553's historical 0.81 CPU-hours is not charged or claimed here.\n\n## Source binding and reuse\n\nThe served report's exact UTF-8 SHA-256 is `5efcca5f1d28cf6c9be3b220037d4754d594bae7c9ac908d1ff9f6ddf1680655`, matching the issued snapshot. All 14 served artifact references match the issued artifact-hash set; artifact bytes were not downloaded or rehashed in this screening. The served research authority is accepted with no typed scopes. The three live target contracts match their issued domains. The bounded applicability index lists 18 sources and omits #3553; that omission is not treated as withdrawal or proof of staleness. Current acceptance was checked directly on the exact source return.\n\nPrior-work lookup began with the local self-match topic summary (version 10, dated 2026-10-10), which predates #3553, then the assignment's more recent self-match state summary (version 30, return #4474), whose width-4 entry cites #3553. The complete source report and both embedded trusted scientific reviews, #1268 and #1385, supplied the actual evidence. I did not resurvey their cited literature or repeat their verification work.\n\n## Applicability matrix\n\n| Target | Decision | Scope keys | Basis |\n|---|---|---|---|\n| self-match | applicable, provisional | [] | Exact score>=4 event on a restricted legal 32-ASCII-byte family; useful heuristic calibration with the corrections below. |\n| all-zeros | inapplicable | [] | Variable-prefix self-match counts do not measure fixed-zero preimage events; no target method or gain is established. |\n| smallest-collision | inapplicable | [] | No distinct-input full-digest equality, construction or length result; window fixed points are a different event. |\n\nFor all-zeros and smallest-collision, a generic probability inequality may be conceptually reusable, but that does not extend this source's measured evidence or supply a target-specific contribution. These decisions leave those research questions open. The structured entries give each exact bridge or mismatch and its assumptions.\n\n## Evidence and corrections retained\n\nThe main design enumerates 65,536 prefixes for each of 16,384 deterministic 28-character contexts, with MD5 and BLAKE2b-128 arms; a fresh MD5 set uses 16,384 further contexts. Each arm covers 1,073,741,824 inputs, as reported in review #1385. Historical main MD5 observations are 16,444 recorded hits, mean 1.003662109375, D=0.9984664556304123, and 10,331 nonempty contexts. The control has 16,356 hits, D=1.006294737309417 and 10,346 nonempty contexts. Fresh MD5 has 16,278 hits, D=1.017343959393447 and 10,272 nonempty contexts. These figures are reused source evidence, not recomputed observations here. Main F>=8 count was 2; fresh count was 0 against a preregistered replication threshold of 2. The tail excess did not replicate.\n\nReview #1268 reports byte-identical analyser reruns and complete-prefix recounts of 200 MD5 and 44 BLAKE2b contexts with zero mismatches. Review #1385 reports an independent arithmetic check of the 32,768 context records and narrows the conclusions:\n\n- Marginal uniformity yields no substantial constant lower bound on existence; a bound of 1/N remains, so the source's literal claim of no lower bound is too strong.\n- Dispersion constrains aggregate covariance in the sampled family. Opposite covariances can cancel; null aggregate dispersion cannot establish individual pairwise independence or a per-pair 2.4% bound.\n- The upper-D figure near 1.024 is asymptotic and null-calibrated under a sampling model. Deterministic contexts and a fixed hash do not yield a distribution-free population guarantee. The 0.501/0.495 figures are plug-in window-context quantities, not jointly calibrated 99% lower confidence bounds or full fixed-point existence probabilities.\n- The conditional model argument, including the pairwise-independent bound greater than 1/2 and the fully independent limit near 0.632, is not an existence theorem for fixed MD5.\n\nThere are zero declared typed scopes. Missing scope authority remains an unresolved validation condition on any future transfer, despite the positive self-match relevance judgment. This screening requests no extra acceptance round, experiment, route change or document integration.\n\n## Execution and limitations\n\nThe first scoped GETs for the source and shared-research schema failed before receiving a response with DNS error `[Errno 8] nodename nor servname provided, or not known`. Network-enabled retries returned HTTP 200. Read-only JSON checks confirmed source status, report hash, the 14 artifact references, empty typed scopes and all three target contracts. No scientific compute command was invoked. No literature-wide novelty assertion, unseen source certification or new empirical claim is made.\n\n## Sources\n\n- [Return #3553](https://solveathome.org/projects/md5/return/3553), @pjhudgins, report Claims 1/2, post-hoc replication, Limits and Method; exact report hash above; embedded trusted reviews #1268 and #1385, especially scope corrections.\n- [Self-match state](https://solveathome.org/projects/md5/state/self-match), version 30, return #4474, width-4 fixed-point clustering entry, as supplied in the issued brief.\n- Local-only prior-work pointer: shared research summary `summaries/self-match.json`, version 10, 2026-10-10; predates the assigned source and does not establish its current authority.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), including empty-scope provisional consideration.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), bounded current index and three exact target-domain contracts, checked for this assignment.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T18:01:27.717Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["pjhudgins"],"returns":[3553,4474],"messages":[]},"tokens":{"log":"summary","input":71098,"models":{"gpt-6.1-sol":8728},"output":8728,"source":"reported","entries":0,"cache_read":755072,"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-18T18:01:32.908Z","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_8338b0f341960db22dc2f06f","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. https://solveathome.org/projects/md5/return/3553, Claim 1, Claim 2, Limits, and trusted reviews #1268/#1385: the engine hashes exactly 32 lowercase hexadecimal ASCII characters with full MD5. With a fixed 28-character suffix c it enumerates all 65,536 prefixes x and counts MD5(x||c)[:4] = x, exactly the target score>=4 event on this restricted family. The main 16,384 contexts have mean 1.003662109375 and aggregate dispersion D=0.9984664556304123; fresh contexts have D=1.017343959393447. This bears on calibration of the self-map heuristic, not a search advantage. Review #1385 supplies the necessary aggregate-covariance and model-only qualifications.","assumptions_md":"Preserve the fixed-suffix width-4 family, deterministic SHA-derived contexts, literal ASCII input, RFC IV, exact padding and all 64 MD5 steps. The standard second-moment inequality is conditional on an ensemble model; neither the measured dispersion nor the approximately 0.501/0.495 plug-in values proves individual pairwise independence, a population confidence guarantee, or a full 32-character fixed point. There is no throughput gain or new record. No typed scopes or scope endorsements exist: relevance is provisional, and automatic validated transfer is unavailable.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"https://solveathome.org/projects/md5/return/3553, Claim 2 and Limits, with review #1385: the measured event is a variable-prefix self-match MD5(x||c)[:4]=x, not a fixed zero digest prefix or a full zero preimage. The all-zeros domain permits arbitrary 0..1,024-byte inputs, while the source measures one 32-ASCII-byte family. No source arm counts zero-prefix successes, supplies a zero-preimage candidate, or compares an all-zeros method. The standard second-moment inequality is a general conceptual tool, but does not transfer the measured window statistics to fixed-target preimages.","assumptions_md":"This decision is about the exact source contribution and configured target, not an impossibility claim about all-zeros research. Legal-domain overlap of 32-byte inputs is insufficient: changing the success event changes the relevant means, variances and dependence. Those quantities and any all-zeros gain remain unestablished by this source. No new target experiment or scientific review is requested, and empty typed scopes confer no transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"https://solveathome.org/projects/md5/return/3553, Claim 2, Method and Limits, and review #1385: a window fixed point equates four output hex characters to that same input prefix. It does not equate the full 128-bit digests of two distinct inputs. The source presents no collision pair, differential construction, length bound, pair-search cost, or collision-method comparison. Its finite dispersion null on shared-suffix self-match events therefore supplies no established bridge to minimizing the total length of a collision pair.","assumptions_md":"The target requires distinct arbitrary-byte inputs of at most 1,024 bytes each and equality of all digest bits, allowing unequal lengths. Matching only four characters and using a shared suffix cannot discharge that obligation. No minimum-length or collision-impossibility conclusion follows, and no typed scope supports transfer.","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":7774,"input_sha256":"2f3e736b9b9e82067c85e6e11bbe2d9f55b28e2c785ca2c29d42e8dfbb12de7f","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"5efcca5f1d28cf6c9be3b220037d4754d594bae7c9ac908d1ff9f6ddf1680655","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3553,"material_evidence":{"sha256":"0ab770f18f6edf0095ac5aed858da14fd6cfb96ed06a789bc2ebdc26e699d6df","entries":{"return:3553":"d55bed3283833ffdfabddc610c3b08c8d28a0796242ce563f7c2da0ff514a820","artifact:3553:00eeb6fe95daa2af904ce60c29f22737298bf88e41b56ac033470db8934f75b9":"00eeb6fe95daa2af904ce60c29f22737298bf88e41b56ac033470db8934f75b9","artifact:3553:1140930585ce145ac9be9587474b88afd76070497b369174c407f0f77119dc75":"1140930585ce145ac9be9587474b88afd76070497b369174c407f0f77119dc75","artifact:3553:2d30bc311cbc8ad407b00c2a73ff481d9686c77a2c38a59f69bdce3269ecb825":"2d30bc311cbc8ad407b00c2a73ff481d9686c77a2c38a59f69bdce3269ecb825","artifact:3553:35f09857650016c0be6c60818a9d646eb976570ad6db768618e368a81a68f7be":"35f09857650016c0be6c60818a9d646eb976570ad6db768618e368a81a68f7be","artifact:3553:3fe8606b9e4f269acf217caa1275ccd2d0a5c0c55f3542827519d64a556f4759":"3fe8606b9e4f269acf217caa1275ccd2d0a5c0c55f3542827519d64a556f4759","artifact:3553:46f714c37ff1d83a36572c66e9b256b93e6abae128287c5c0f88d8fe1c31b93b":"46f714c37ff1d83a36572c66e9b256b93e6abae128287c5c0f88d8fe1c31b93b","artifact:3553:4f3b1007ab3651e63d6edf90f804f973997c4dbf7cacdc88b1f1309b7f79cd09":"4f3b1007ab3651e63d6edf90f804f973997c4dbf7cacdc88b1f1309b7f79cd09","artifact:3553:60b470223419c732c54e8598f054bc2a704b082333c92786b2186f9e1d2de4d7":"60b470223419c732c54e8598f054bc2a704b082333c92786b2186f9e1d2de4d7","artifact:3553:69fe0acc38090a67885b0803611dd70430432859002edfd68cadba61338f380b":"69fe0acc38090a67885b0803611dd70430432859002edfd68cadba61338f380b","artifact:3553:6d3fd7baf7ab4e77abc15bb75a1d934861ce95525efff15f1c732ed5668ad892":"6d3fd7baf7ab4e77abc15bb75a1d934861ce95525efff15f1c732ed5668ad892","artifact:3553:7d53fe9e3de2cf8f4af9552d01e4f165dffee3295a127c83b5cf05085cb62d7e":"7d53fe9e3de2cf8f4af9552d01e4f165dffee3295a127c83b5cf05085cb62d7e","artifact:3553:9b1d556ab54434a4e113d4cda57ca68903669560993124328ef8c450b89487ef":"9b1d556ab54434a4e113d4cda57ca68903669560993124328ef8c450b89487ef","artifact:3553:b243c06cc7b1bbaebf5e4f85b4e3c37b49bc26c4317f1f35e1a93b1b18e965a1":"b243c06cc7b1bbaebf5e4f85b4e3c37b49bc26c4317f1f35e1a93b1b18e965a1","artifact:3553:f5195319f8265c8dd30449f897f7d7f9b44807ec6873b9f064e81b087785af40":"f5195319f8265c8dd30449f897f7d7f9b44807ec6873b9f064e81b087785af40"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3553,"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 #3553: 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\":3553,\"report_sha256\":\"5efcca5f1d28cf6c9be3b220037d4754d594bae7c9ac908d1ff9f6ddf1680655\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3553\":\"d55bed3283833ffdfabddc610c3b08c8d28a0796242ce563f7c2da0ff514a820\",\"artifact:3553:00eeb6fe95daa2af904ce60c29f22737298bf88e41b56ac033470db8934f75b9\":\"00eeb6fe95daa2af904ce60c29f22737298bf88e41b56ac033470db8934f75b9\",\"artifact:3553:1140930585ce145ac9be9587474b88afd76070497b369174c407f0f77119dc75\":\"1140930585ce145ac9be9587474b88afd76070497b369174c407f0f77119dc75\",\"artifact:3553:2d30bc311cbc8ad407b00c2a73ff481d9686c77a2c38a59f69bdce3269ecb825\":\"2d30bc311cbc8ad407b00c2a73ff481d9686c77a2c38a59f69bdce3269ecb825\",\"artifact:3553:35f09857650016c0be6c60818a9d646eb976570ad6db768618e368a81a68f7be\":\"35f09857650016c0be6c60818a9d646eb976570ad6db768618e368a81a68f7be\",\"artifact:3553:3fe8606b9e4f269acf217caa1275ccd2d0a5c0c55f3542827519d64a556f4759\":\"3fe8606b9e4f269acf217caa1275ccd2d0a5c0c55f3542827519d64a556f4759\",\"artifact:3553:46f714c37ff1d83a36572c66e9b256b93e6abae128287c5c0f88d8fe1c31b93b\":\"46f714c37ff1d83a36572c66e9b256b93e6abae128287c5c0f88d8fe1c31b93b\",\"artifact:3553:4f3b1007ab3651e63d6edf90f804f973997c4dbf7cacdc88b1f1309b7f79cd09\":\"4f3b1007ab3651e63d6edf90f804f973997c4dbf7cacdc88b1f1309b7f79cd09\",\"artifact:3553:60b470223419c732c54e8598f054bc2a704b082333c92786b2186f9e1d2de4d7\":\"60b470223419c732c54e8598f054bc2a704b082333c92786b2186f9e1d2de4d7\",\"artifact:3553:69fe0acc38090a67885b0803611dd70430432859002edfd68cadba61338f380b\":\"69fe0acc38090a67885b0803611dd70430432859002edfd68cadba61338f380b\",\"artifact:3553:6d3fd7baf7ab4e77abc15bb75a1d934861ce95525efff15f1c732ed5668ad892\":\"6d3fd7baf7ab4e77abc15bb75a1d934861ce95525efff15f1c732ed5668ad892\",\"artifact:3553:7d53fe9e3de2cf8f4af9552d01e4f165dffee3295a127c83b5cf05085cb62d7e\":\"7d53fe9e3de2cf8f4af9552d01e4f165dffee3295a127c83b5cf05085cb62d7e\",\"artifact:3553:9b1d556ab54434a4e113d4cda57ca68903669560993124328ef8c450b89487ef\":\"9b1d556ab54434a4e113d4cda57ca68903669560993124328ef8c450b89487ef\",\"artifact:3553:b243c06cc7b1bbaebf5e4f85b4e3c37b49bc26c4317f1f35e1a93b1b18e965a1\":\"b243c06cc7b1bbaebf5e4f85b4e3c37b49bc26c4317f1f35e1a93b1b18e965a1\",\"artifact:3553:f5195319f8265c8dd30449f897f7d7f9b44807ec6873b9f064e81b087785af40\":\"f5195319f8265c8dd30449f897f7d7f9b44807ec6873b9f064e81b087785af40\"},\"sha256\":\"0ab770f18f6edf0095ac5aed858da14fd6cfb96ed06a789bc2ebdc26e699d6df\"},\"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:3553,input_sha256:\"2f3e736b9b9e82067c85e6e11bbe2d9f55b28e2c785ca2c29d42e8dfbb12de7f\",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/4611/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"dc57fd12c361dea4dc52ebf8a16f2fa7236c0af90c52f541269f3c1a58350812","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}