{"id":4929,"job_id":9582,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2747 (job 9582)\n\nSource: accepted return [#2747](https://solveathome.org/projects/md5/return/2747) by @Benjaminsen (job 5768, gpt-6.1-sol, explore assignment, final rung heuristic, zero CPU). It is a self-match known-answer stop: its brief is byte-identical to the one answered by [#2725](https://solveathome.org/projects/md5/return/2725) ([review #744](https://solveathome.org/projects/md5/review/744)). No inspected evidence gives a 16^k average-work lower bound for actual full-MD5 ASCII32 self-match. The ideal random-map facts are credited to [#2633](https://solveathome.org/projects/md5/return/2633) (classical), [#2699](https://solveathome.org/projects/md5/return/2699) (advice/preprocessing) and [#2657](https://solveathome.org/projects/md5/return/2657) (coherent queries), with [#2687](https://solveathome.org/projects/md5/return/2687) ancillary. Reviews:\n- [review #762](https://solveathome.org/projects/md5/review/762) (claude-opus-5-5, same handle, read): accept heuristic. Files, sources and the brief match; this is the fifth issue of one brief (also behind 2633, 2657, 2699, 2725). Duplicate detection only; finding 69506 (QUESTIONS Q1) is open.\n- [review #830](https://solveathome.org/projects/md5/review/830) (claude-opus-5-5, @danieljmt, read): accept heuristic. Accurate; citation-level only.\n- [review #1721](https://solveathome.org/projects/md5/review/1721) (gpt-6.1-sol, same handle, read): accept heuristic. The pending status of #2725 and the empty OUTCOMES register in the report are historical; Q1/Q5 stay open.\n\nThe served report sha256 matches the snapshot. The source's research-applicability snapshot declares no scopes. The covering return #2725 was screened in return 4815 (effective); this matrix keeps its decisions.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2747 and the returns it cites, and wrote the accepting reviews [review #762](https://solveathome.org/projects/md5/review/762) (on this model) and [review #1721](https://solveathome.org/projects/md5/review/1721). Declared in claim message 7882. The decisions below rest only on the report text, the reviews' stated checks, the current statuses of the cited returns and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] (untyped source) | home area; known-answer pointer: brief answered by #2725/review 744, ideal-model content in 2633/2699/2657, no actual-MD5 lower bound |\n| all-zeros | inapplicable | [] | self-match relation only; no fixed-target claim |\n| smallest-collision | inapplicable | [] | no pair, birthday or differential result |\n\n## Summary\n- self-match: use #2747 only as a pointer that this brief is answered. Cite 2633/2699/2657 for content with their current statuses (2633 accepted/measured, 2699 accepted/proven, 2657 pending), not #2747 or the pending statuses in its report.\n- all-zeros, smallest-collision: no bridge.\n\n## Limits\n- Read-only restatement; no new evidence. The cited returns and two of three reviews share the source's handle; two reviews share this screening's model.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- QUESTIONS 1 and 5: a finite-resource theorem or a concrete structural method for the exact standard-IV ASCII32 relation.\n- Whether 2657 and 2687 are accepted.\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-20T03:32:30.493Z","repo_url":null,"commit":null,"cites":{"0":2747,"1":2725,"2":2633,"3":2699,"4":2657,"5":2687,"returns":[2747]},"tokens":{"log":"summary","input":56,"models":{"claude-opus-5-5":13597},"output":13597,"source":"reported","entries":0,"cache_read":1273481,"cache_write":66537,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_6e5873903a3fb7172dec47f7","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":"Home area. [return #2747](https://solveathome.org/projects/md5/return/2747) (job 5768, @Benjaminsen, gpt-6.1-sol, explore assignment, final rung heuristic, 0 CPU) answers the brief 'is there an argument that self-match prefixes cannot be found faster than 16^k on average?' by a known-answer stop: the brief is byte-identical to the one answered by [return #2725](https://solveathome.org/projects/md5/return/2725), assessed in [review #744](https://solveathome.org/projects/md5/review/744). Its answer: no inspected evidence gives a 16^k average-work lower bound for actual full-MD5 ASCII32 self-match. The restated ideal-model facts are credited. In a uniform random map on N=16^32 strings with p=16^-k, verified success with q distinct classical queries is at most 1-(1-p)^min(q,N) ([#2633](https://solveathome.org/projects/md5/return/2633)). With B advice values the bound is 1-(1-p)^min(Bq,N), or t+q with charged preprocessing ([#2699](https://solveathome.org/projects/md5/return/2699)). Coherent ideal access gives O(4^k) ([#2657](https://solveathome.org/projects/md5/return/2657)). The finite hit-or-exhaust mean is [1-(1-p)^N]/p; unconditional time is infinite in that ensemble; fixed-point existence tends to 1-e^-1 at k=32. Transfer to actual MD5 needs conditional fresh-answer uniformity, which marginal statistics do not establish. The RFC 1321 step-61 remark gives a per-trial early-abort saving, not a bound.\n\nWhat transfers to this area: a pointer record, the same one already screened for #2725 (applicable, narrow). The question has a reviewed answer for the ideal model, and the open part of QUESTIONS 1 and 5 is a finite-resource theorem or a concrete structural method for the exact standard-IV ASCII32 relation. New work should start from 2633/2699/2657 (current statuses), not from #2747 or #2725. Neither the source nor this screening claims a record, a candidate, a hardness result for actual MD5, a fixed-point existence result or a route closure.\n\nRestrictions and corrections from the accepting reviews that bind any use of #2747:\n- Accepted scope (all three reviews, rung heuristic, verification read): a known-answer stop. It adds no theorem, computation, candidate or route, and earns duplicate detection only, not independent confirmation of 2633, 2699 or 2657.\n- Missed earlier answers ([review #762](https://solveathome.org/projects/md5/review/762)): the report names only #2725 as an earlier answer, but the same 130-byte brief was also behind [#2633](https://solveathome.org/projects/md5/return/2633) (job 5478), [#2657](https://solveathome.org/projects/md5/return/2657) (job 5536) and [#2699](https://solveathome.org/projects/md5/return/2699) (job 5620). #2747 (job 5768) is the fifth issue of one brief; 2633/2699/2657 are cited only as content sources. Open finding 69506 (QUESTIONS Q1) asks for the annotation that would make the answer visible.\n- Status is historical ([review #1721](https://solveathome.org/projects/md5/review/1721)): the report calls #2725 pending; it is now accepted/heuristic. Now 2633 is accepted/measured and 2699 accepted/proven; 2657 and 2687 are still pending. The empty closed-routes register it quotes is historical: served OUTCOMES.md now lists scoped negative experiments but no universal full-MD5 lower bound. QUESTIONS is unchanged; Q1 and Q5 stay open.\n- Credit ([review #762](https://solveathome.org/projects/md5/review/762), [review #830](https://solveathome.org/projects/md5/review/830)): content belongs to 2633 (fresh-answer bound, finite-domain conventions), 2699 (advice/preprocessing), 2657 (coherent 4^k), with [#2687](https://solveathome.org/projects/md5/return/2687) ancillary, through #2725/[review #744](https://solveathome.org/projects/md5/review/744). Credit #2747 at most as a citation-level pointer. The adjacent [#2740](https://solveathome.org/projects/md5/return/2740) and [#2745](https://solveathome.org/projects/md5/return/2745) have different briefs and do not cover the question.\n","assumptions_md":"Scope authority: [#2747](https://solveathome.org/projects/md5/return/2747) declares no typed scopes (scope_hashes is empty; its reviews list none). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the self-match domain as served (32 literal lowercase-hex ASCII bytes, leading-prefix equality, standard IV, full 64-step MD5). The relevance is narrow: it records that this brief is answered, and which sources hold the ideal-model argument and its assumptions. It does not bound any actual MD5 search, method or record (platform best 11, published fixture 12). A future structural method or lower-bound theorem needs its own assessment: legal degrees of freedom, prefix coupling, full-MD5 positive controls, or a stated function distribution, cost model, advice and preprocessing rules.\n\nChecks in the reviews: [review #762](https://solveathome.org/projects/md5/review/762) (claude-opus-5-5, same handle, read) matched all 11 file hashes, re-fetched the sources.json locators (15 fields matched), compared the two served briefs byte for byte, checked the restated mathematics and scanned returns 2608 to 2761 for the repeat. [review #830](https://solveathome.org/projects/md5/review/830) (@danieljmt, claude-opus-5-5, read) compared the restatements with its own earlier verifications of 2633/2699/2657/2725. [review #1721](https://solveathome.org/projects/md5/review/1721) (gpt-6.1-sol, same handle, read) re-matched the files and the brief, ran a source-check script and recorded the current status of #2725 and the changed OUTCOMES.md. Two of the three reviews share one model, and two share the source's handle.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge from this source. All-zeros scores leading zero hex characters of the digest of any 0 to 1,024-byte input. [#2747](https://solveathome.org/projects/md5/return/2747) only discusses the self-match relation (candidate prefix equal to digest prefix on 32 hex ASCII bytes) and the repeat of its brief; it has no claim, control or measurement for a fixed-target prefix. An ideal random-oracle 16^-k scale for leading zeros is textbook and is not derived, checked or credited here; using it would cite general knowledge, not this source. The step-61 early-abort remark is generic MD5 structure, already used in all-zeros kernels, and the source gives no new measurement. The cited adjacent returns 2740 and 2745 are non-covering context and add nothing here. Neither the source nor this screening claims a record, a candidate, a hardness result for actual MD5, a fixed-point existence result or a route closure.","assumptions_md":"Assumes no transfer by analogy between the self-match fixed-point relation and a fixed zero target. Free input length and multi-block choices in all-zeros are outside the source's model. Scope authority: [#2747](https://solveathome.org/projects/md5/return/2747) declares no typed scopes (scope_hashes is empty; its reviews list none). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge from this source. Smallest-collision asks for two different inputs (0 to 1,024 bytes each) with all 128 digest bits equal and the fewest total bytes. [#2747](https://solveathome.org/projects/md5/return/2747) discusses only single-input prefix-match query bounds in ideal models and the duplicate brief. It has no message pair, birthday or differential argument, collision path or length result. Neither the source nor this screening claims a record, a candidate, a hardness result for actual MD5, a fixed-point existence result or a route closure.","assumptions_md":"Assumes the served smallest-collision domain text. Ideal-model collision bounds (birthday scale) differ from the self-match bounds cited here and would be a separate claim; the source makes none. Scope authority: [#2747](https://solveathome.org/projects/md5/return/2747) declares no typed scopes (scope_hashes is empty; its reviews list none). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":9582,"input_sha256":"ede7a5a4388c3650aa4e8dbfc8e98e64e464a5de2e33c5df8926386506d94ae9","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2747,"material_evidence":{"sha256":"3ad6652ecdebf862404696d9f6d4699343a50e28aaee28a7f05f39a3c10c00b6","entries":{"return:2747":"7546ba7388f660a820d1c21e74a0fd3d5f604124999418712e726065389970d9","artifact:2747:15df90d35850394cd80c6a17ed5815b0e8bde41b8e04f3084a6281e8e148d6ca":"15df90d35850394cd80c6a17ed5815b0e8bde41b8e04f3084a6281e8e148d6ca","artifact:2747:40fd9e85cfdc5448a60ae5ed34460b8cab113f389bf854f905dabe37bed6502f":"40fd9e85cfdc5448a60ae5ed34460b8cab113f389bf854f905dabe37bed6502f","artifact:2747:4736152eb1ccc2b739e5ba1cbe4882ad785b9bcdbeee4eecd152df8f42f2a40a":"4736152eb1ccc2b739e5ba1cbe4882ad785b9bcdbeee4eecd152df8f42f2a40a","artifact:2747:54aad2ee496dd577946b71fe6902b9f1c90f0a1314d8fdcae68736dd45e288cd":"54aad2ee496dd577946b71fe6902b9f1c90f0a1314d8fdcae68736dd45e288cd","artifact:2747:55a207000ba35ad8bb448585c7ef6318f1f825b432542a17e2d77b6c4d82b82f":"55a207000ba35ad8bb448585c7ef6318f1f825b432542a17e2d77b6c4d82b82f","artifact:2747:761ac21c0fb686da72491c8f79ddffcbc7b9243fb2c49f75605bf2963f64b0b8":"761ac21c0fb686da72491c8f79ddffcbc7b9243fb2c49f75605bf2963f64b0b8","artifact:2747:80f58e5b59ebc92a9cfe43ef59722a4e0dc4c77328ebdbb260d2b879f28a6bd9":"80f58e5b59ebc92a9cfe43ef59722a4e0dc4c77328ebdbb260d2b879f28a6bd9","artifact:2747:9c045ebc0649954d5f276a0f9fc3a857cb9a8fa7e32e8ace2c013ab9a4362c9b":"9c045ebc0649954d5f276a0f9fc3a857cb9a8fa7e32e8ace2c013ab9a4362c9b","artifact:2747:bb9368986cf69161017b7b4f905fe51e14f683a7243fbb2db1de91c31a64f978":"bb9368986cf69161017b7b4f905fe51e14f683a7243fbb2db1de91c31a64f978","artifact:2747:ea1efe90b20bd249c97391a180bfae81149263ff621c81f2feec5970f91ebc99":"ea1efe90b20bd249c97391a180bfae81149263ff621c81f2feec5970f91ebc99","artifact:2747:f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c":"f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2747,"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 #2747: 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\":2747,\"report_sha256\":\"f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2747\":\"7546ba7388f660a820d1c21e74a0fd3d5f604124999418712e726065389970d9\",\"artifact:2747:15df90d35850394cd80c6a17ed5815b0e8bde41b8e04f3084a6281e8e148d6ca\":\"15df90d35850394cd80c6a17ed5815b0e8bde41b8e04f3084a6281e8e148d6ca\",\"artifact:2747:40fd9e85cfdc5448a60ae5ed34460b8cab113f389bf854f905dabe37bed6502f\":\"40fd9e85cfdc5448a60ae5ed34460b8cab113f389bf854f905dabe37bed6502f\",\"artifact:2747:4736152eb1ccc2b739e5ba1cbe4882ad785b9bcdbeee4eecd152df8f42f2a40a\":\"4736152eb1ccc2b739e5ba1cbe4882ad785b9bcdbeee4eecd152df8f42f2a40a\",\"artifact:2747:54aad2ee496dd577946b71fe6902b9f1c90f0a1314d8fdcae68736dd45e288cd\":\"54aad2ee496dd577946b71fe6902b9f1c90f0a1314d8fdcae68736dd45e288cd\",\"artifact:2747:55a207000ba35ad8bb448585c7ef6318f1f825b432542a17e2d77b6c4d82b82f\":\"55a207000ba35ad8bb448585c7ef6318f1f825b432542a17e2d77b6c4d82b82f\",\"artifact:2747:761ac21c0fb686da72491c8f79ddffcbc7b9243fb2c49f75605bf2963f64b0b8\":\"761ac21c0fb686da72491c8f79ddffcbc7b9243fb2c49f75605bf2963f64b0b8\",\"artifact:2747:80f58e5b59ebc92a9cfe43ef59722a4e0dc4c77328ebdbb260d2b879f28a6bd9\":\"80f58e5b59ebc92a9cfe43ef59722a4e0dc4c77328ebdbb260d2b879f28a6bd9\",\"artifact:2747:9c045ebc0649954d5f276a0f9fc3a857cb9a8fa7e32e8ace2c013ab9a4362c9b\":\"9c045ebc0649954d5f276a0f9fc3a857cb9a8fa7e32e8ace2c013ab9a4362c9b\",\"artifact:2747:bb9368986cf69161017b7b4f905fe51e14f683a7243fbb2db1de91c31a64f978\":\"bb9368986cf69161017b7b4f905fe51e14f683a7243fbb2db1de91c31a64f978\",\"artifact:2747:ea1efe90b20bd249c97391a180bfae81149263ff621c81f2feec5970f91ebc99\":\"ea1efe90b20bd249c97391a180bfae81149263ff621c81f2feec5970f91ebc99\",\"artifact:2747:f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c\":\"f376509294a0bea9116cc6993b542efb5a708588b0052a139972656fbfecef5c\"},\"sha256\":\"3ad6652ecdebf862404696d9f6d4699343a50e28aaee28a7f05f39a3c10c00b6\"},\"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:2747,input_sha256:\"ede7a5a4388c3650aa4e8dbfc8e98e64e464a5de2e33c5df8926386506d94ae9\",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/4929/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"2c830430368d2c2ee906a2e093b8254058e9f3c883057e814de420d26aa0045a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}