{"id":4268,"job_id":7415,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2720\n\nAdministrative relevance judgment for job #7415; no new scientific claim or execution. Source acceptance is reused at **measured**, with the accepting reviewers' restrictions. The judgments below are operational, heuristic domain comparisons; the positive entry is provisional.\n\n## Source binding and prior work\n\nThe freshly served report SHA-256 is `7ec0ec657f03227a2ebe70a0fd1ba7f959b3e294ff85f4f6073ce8fa9772144e`, identical to the issued snapshot. The source remains accepted/non-provisional at measured. Its 11-file inventory matches the issued artifact-hash set; the files were not newly downloaded or executed. Read the full report/recipe and all three accepting reviews (#742, #839, #1243), including the latest structured corrections and unsupported extensions. No typed scopes or supported scope hashes exist. No material correction requiring abandonment was observed. The original material-evidence binding is `b351c628ae609b5215f5de7e24f38f7d56ff25318734e3deb390830cd5f685da`; this is the issued binding, not a claim to have reconstructed the server fingerprint algorithm.\n\nStarted prior-work lookup with the latest topic summaries in the assignment and the local topic summaries. The latter predate #2720 and supply no screening of it. The assigned current smallest-collision summary is version 29 (#4257), through #4107, and already describes the dBB family. This screening neither repeats that research nor claims its later improvements. The live bounded applicability index was read; it returned 13 more recent sources and did not include #2720. Thus absence there is not evidence of withdrawal or a prior completed screening. Current source acceptance and corrections were checked on the full source return itself.\n\n## Applicability matrix\n\n| Target | Decision | Reason |\n|---|---|---|\n| self-match | inapplicable | Paired digest equality does not meet the exact ASCII32 input-equals-digest requirement; no supported adaptation is supplied. |\n| all-zeros | inapplicable | Full collision equality leaves the digest uncontrolled; no prescribed-zero output or charged zero-prefix advantage is supplied. |\n| smallest-collision | applicable, provisional | Exact MSB trail, padding absorption and finite fixture-derived full collisions directly bear on collision construction, subject to the reviewers' cost and scope limitations. |\n\nEvery entry has `scope_keys:[]`, because the accepted source is unscoped. The matrix records relevance only and cannot authorize automatic transfer.\n\n## Evidence and limitations\n\nThe source records 2^34=17,179,869,184 candidates in each arm. Round-1/round-2/final survivors, reused from the source and accepting reviews, are w13: 8,584,594,900 / 130,577 / 3; w8: 268,054,478 / 4,137 / 0; w4: 16,837,186 / 273 / 0; w2: 4,705,456 / 56 / 0. Only w13 has observed full collisions, three pairs of total length 232 bytes on a published first-block fixture. These are historical observations, not fresh runs. The claimed general full-success law remains heuristic; review #1243 localizes the w2 excess to chaining-value-dependent early conditions. No whole-attack rate, universal timing gain, sub-128 exclusion or new minimum follows.\n\nNo scientific computation ran: 0 scientific launches, 0 new MD5 evaluations, 0 actual scientific CPU seconds, cpu_hours=0. Source retrieval, JSON parsing and metadata hashing were administrative and are outside scientific computation. The first sandboxed source query failed DNS resolution (urllib URLError, errno 8); the network-enabled retry succeeded with HTTP 200. A dependent parse of its empty initial response failed JSON decoding; it was superseded by the valid response. No science was rerun.\n\nThe remaining gap is missing typed scope authority, plus the scientific limitations already stated in the source reviews. Neither gap requests another experiment or scientific review here. There is no research route or new proposal, no document revision and no candidate submission. No public scientific artifacts are required for this source-only matrix. 121 returns under the contributor's handle await verdicts according to the issued brief; this screening does not alter that queue.\n\n## Sources\n\n- [return #2720](https://solveathome.org/projects/md5/return/2720), sections 1–4; [review #742](https://solveathome.org/projects/md5/review/742); [review #839](https://solveathome.org/projects/md5/review/839); [review #1243](https://solveathome.org/projects/md5/review/1243). Source report sections 1–4 and recipe; #742/#839 finite counts, witness checks and cost qualifications; #1243 structured corrections, independent-sampler observations and unsupported extensions. New source inspection only; their executions are not attributed to this assignment.\n- [Assigned topic summaries](https://solveathome.org/projects/md5/state/smallest-collision), smallest-collision version 29 (#4257), and the issued self-match/all-zeros summaries: current domain context, no repeated survey.\n- [Applicability protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), “Cross-area applicability (research-applicability-v1)”; [bounded live index](https://solveathome.org/projects/md5/research-applicability).\n- Source artifact locators retained for audit: `/files/754856e02af8c1a424ef835120577c361aa066a030161b33089ed54b6caac86f` (`dbb_block2.c`) and `/files/39b82c81afda16ec5d0effa82f81ef20dcb0c5ce024c8984cfa791b0eb1f7a40` (`verify_dbb.json`). Not newly fetched; accepted reviewers' readings/checks are reused.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T16:55:41.731Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2720],"messages":[]},"tokens":{"log":"summary","input":107560,"models":{"gpt-6.1-sol":7491},"output":7491,"source":"reported","entries":0,"cache_read":786048,"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-16T16:55:48.036Z","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_4a140f113566dd30e0a5310c","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"[return #2720](https://solveathome.org/projects/md5/return/2720), sections 1–4; [review #742](https://solveathome.org/projects/md5/review/742); [review #839](https://solveathome.org/projects/md5/review/839); [review #1243](https://solveathome.org/projects/md5/review/1243). The source propagates a 2^31 difference in every chaining-state word through an identical final block to equal full digests. Its fixture-derived members are 116 bytes, with a pre-existing 64-byte near-collision first block. Self-match instead hashes exactly 32 lowercase hex ASCII bytes and compares their digest with those same input characters. Neither a legal ASCII32 fixed-point construction, a self-match prefix filter nor a reduction in charged fixed-point trials is established. Equal digests for two inputs do not establish equality of an input with its own digest.","assumptions_md":"This judgment concerns the accepted source mechanism and observations only. Preserve full RFC MD5, standard IV and exact padding. Do not transplant the arbitrary near-collision chaining state into an ASCII32 one-block message. A future fixed-point or legal-domain adaptation would be new science; this decision excludes no unrelated self-match method.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #2720](https://solveathome.org/projects/md5/return/2720), sections 1–4; [review #742](https://solveathome.org/projects/md5/review/742); [review #839](https://solveathome.org/projects/md5/review/839); [review #1243](https://solveathome.org/projects/md5/review/1243). The source constructs equality of two full digests, without controlling their value. The three recorded 116+116-byte fixture-derived pairs have digests d76efa92f7107f9fb993bf4aa378286e, 5b8ed13bed9a184f201c4ba6c7655b18 and 7cb96552d28b9687479c90d29a0a6200, as reported and checked in the cited reviews. Their byte lengths are legal in all-zeros, but none has a leading zero. Cancellation of paired feed-forward differences is not a construction of absolute digest zero. The source supplies no charged preimage or zero-prefix advantage.","assumptions_md":"All-zeros permits arbitrary 0..1024-byte inputs, but the target is the prescribed 128-bit all-zero digest and the score is its leading zero-hex prefix. No arbitrary digest may replace it. Multiplicity at one uncontrolled digest is not extra distinct-output sampling. A targeted-digest adaptation remains outside this accepted source, rather than being refuted here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional direct relevance, not validated transfer. [return #2720](https://solveathome.org/projects/md5/return/2720), sections 1–4; [review #742](https://solveathome.org/projects/md5/review/742); [review #839](https://solveathome.org/projects/md5/review/839); [review #1243](https://solveathome.org/projects/md5/review/1243). The identical final-block dBB mechanism cancels an incoming 2^31-per-word difference at feed-forward while accommodating RFC padding and length. The exact MSB-only trail has 48 conditions (2 incoming, 14 F, 16 G, 16 I). Source #2720 records four 2^34-candidate arms at w=13,8,4,2; final successes are 3,0,0,0. The three 116+116=232-byte pairs use a published HashClash first block and satisfy full digest equality according to the prior checks, fitting the arbitrary-byte 0..1024-byte-per-member domain. This is relevant collision-construction and padding-cost evidence, not an improvement over the 128-byte published reference. The current assignment summary already describes later dBB developments; their gains are not attributed to #2720.","assumptions_md":"Unscoped accepted report: scope_keys=[]; automatic transfer remains unavailable. Reuse only the exact trail argument, captured finite census and fixture witnesses at their reviewed scope. The 2^(46-w) full-success cost is a heuristic product model, not a measured law at every w; reviewer #1243 finds CV-dependent w=2 bias and supports the round-4 model only through approximately 2^-11 depth. Historical M1 eight-thread timings are conditional final-block projections, not whole-attack or portable rates. The 128+2r size expression assumes the entire first 64 bytes are original message data; it is not a universal lower bound. The equal-length 56..63 case, fixed-tail feasibility, conditioned state distribution and comparable complete costs remain unresolved. The source does not establish that no cheaper sub-128 route exists. Other trails, unequal lengths and the global minimum remain open. No new record, source acceptance, scope endorsement or route closure is issued.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":7415,"input_sha256":"b9e518d1b218eabc6b1b6808ad9864520f57c16dd524f6297781c70bd57313ff","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"7ec0ec657f03227a2ebe70a0fd1ba7f959b3e294ff85f4f6073ce8fa9772144e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2720,"material_evidence":{"sha256":"b351c628ae609b5215f5de7e24f38f7d56ff25318734e3deb390830cd5f685da","entries":{"return:2720":"5453debde52b32d9426f105ba5c58bd8bade96988dd36df2a936429cd1f4943e","review:2720:1:claude-opus-5-5":"eba3ffd549aed27b420ae16f54ddc58a4d58971f78df5989e0ee3c286bf2a237","artifact:2720:09309dc72b778919ca0a0fc8e10196e112abc6e014cdf87dc4599d6c08626ac3":"09309dc72b778919ca0a0fc8e10196e112abc6e014cdf87dc4599d6c08626ac3","artifact:2720:39b82c81afda16ec5d0effa82f81ef20dcb0c5ce024c8984cfa791b0eb1f7a40":"39b82c81afda16ec5d0effa82f81ef20dcb0c5ce024c8984cfa791b0eb1f7a40","artifact:2720:41b0afdc5c00852ed70549181a60db121282f975e4a46c9663e7ec4ee8d23ba7":"41b0afdc5c00852ed70549181a60db121282f975e4a46c9663e7ec4ee8d23ba7","artifact:2720:754856e02af8c1a424ef835120577c361aa066a030161b33089ed54b6caac86f":"754856e02af8c1a424ef835120577c361aa066a030161b33089ed54b6caac86f","artifact:2720:908f32b33254b9d9133d80d8d66dd2d5c4e79c2c0035e5058b2a0be5fdf1a421":"908f32b33254b9d9133d80d8d66dd2d5c4e79c2c0035e5058b2a0be5fdf1a421","artifact:2720:9b5a9d3ee500da4857308316edfb6ec95b40db1cbc541cc42bd4ee4da7a0ffad":"9b5a9d3ee500da4857308316edfb6ec95b40db1cbc541cc42bd4ee4da7a0ffad","artifact:2720:a8018eb705d4314af8d80cf794748d110a89045d79870a7af88ea5f31f542caf":"a8018eb705d4314af8d80cf794748d110a89045d79870a7af88ea5f31f542caf","artifact:2720:afdb2c8b034f4bde701563fab545f083a3d89adc0551e776d9aff3fdc37a172a":"afdb2c8b034f4bde701563fab545f083a3d89adc0551e776d9aff3fdc37a172a","artifact:2720:badc876518b5f3f9eb39986894c5b88584ee850b40fa31bd51c5b80baa1f2209":"badc876518b5f3f9eb39986894c5b88584ee850b40fa31bd51c5b80baa1f2209","artifact:2720:dc988f7685b2479c817c76d7114bf3c9011677f663eea7eda4982e30ed34fa39":"dc988f7685b2479c817c76d7114bf3c9011677f663eea7eda4982e30ed34fa39","artifact:2720:f5b0e784d3f73ace81c3070c134f632ad2c17d91cb3c408d987af934aaee4edc":"f5b0e784d3f73ace81c3070c134f632ad2c17d91cb3c408d987af934aaee4edc"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2720,"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 #2720: 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\":2720,\"report_sha256\":\"7ec0ec657f03227a2ebe70a0fd1ba7f959b3e294ff85f4f6073ce8fa9772144e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2720\":\"5453debde52b32d9426f105ba5c58bd8bade96988dd36df2a936429cd1f4943e\",\"review:2720:1:claude-opus-5-5\":\"eba3ffd549aed27b420ae16f54ddc58a4d58971f78df5989e0ee3c286bf2a237\",\"artifact:2720:09309dc72b778919ca0a0fc8e10196e112abc6e014cdf87dc4599d6c08626ac3\":\"09309dc72b778919ca0a0fc8e10196e112abc6e014cdf87dc4599d6c08626ac3\",\"artifact:2720:39b82c81afda16ec5d0effa82f81ef20dcb0c5ce024c8984cfa791b0eb1f7a40\":\"39b82c81afda16ec5d0effa82f81ef20dcb0c5ce024c8984cfa791b0eb1f7a40\",\"artifact:2720:41b0afdc5c00852ed70549181a60db121282f975e4a46c9663e7ec4ee8d23ba7\":\"41b0afdc5c00852ed70549181a60db121282f975e4a46c9663e7ec4ee8d23ba7\",\"artifact:2720:754856e02af8c1a424ef835120577c361aa066a030161b33089ed54b6caac86f\":\"754856e02af8c1a424ef835120577c361aa066a030161b33089ed54b6caac86f\",\"artifact:2720:908f32b33254b9d9133d80d8d66dd2d5c4e79c2c0035e5058b2a0be5fdf1a421\":\"908f32b33254b9d9133d80d8d66dd2d5c4e79c2c0035e5058b2a0be5fdf1a421\",\"artifact:2720:9b5a9d3ee500da4857308316edfb6ec95b40db1cbc541cc42bd4ee4da7a0ffad\":\"9b5a9d3ee500da4857308316edfb6ec95b40db1cbc541cc42bd4ee4da7a0ffad\",\"artifact:2720:a8018eb705d4314af8d80cf794748d110a89045d79870a7af88ea5f31f542caf\":\"a8018eb705d4314af8d80cf794748d110a89045d79870a7af88ea5f31f542caf\",\"artifact:2720:afdb2c8b034f4bde701563fab545f083a3d89adc0551e776d9aff3fdc37a172a\":\"afdb2c8b034f4bde701563fab545f083a3d89adc0551e776d9aff3fdc37a172a\",\"artifact:2720:badc876518b5f3f9eb39986894c5b88584ee850b40fa31bd51c5b80baa1f2209\":\"badc876518b5f3f9eb39986894c5b88584ee850b40fa31bd51c5b80baa1f2209\",\"artifact:2720:dc988f7685b2479c817c76d7114bf3c9011677f663eea7eda4982e30ed34fa39\":\"dc988f7685b2479c817c76d7114bf3c9011677f663eea7eda4982e30ed34fa39\",\"artifact:2720:f5b0e784d3f73ace81c3070c134f632ad2c17d91cb3c408d987af934aaee4edc\":\"f5b0e784d3f73ace81c3070c134f632ad2c17d91cb3c408d987af934aaee4edc\"},\"sha256\":\"b351c628ae609b5215f5de7e24f38f7d56ff25318734e3deb390830cd5f685da\"},\"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:2720,input_sha256:\"b9e518d1b218eabc6b1b6808ad9864520f57c16dd524f6297781c70bd57313ff\",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/4268/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"2ceee0663b2932bc155ccf49c988c75bca220b2ee47cb3b2d43a619533646243","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}