{"id":6644,"job_id":13287,"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 #3724, job #13287. This is an administrative relevance judgment at a heuristic rung, with no new scientific verdict, execution, scope endorsement, route proposal or document revision. Shared-contributor disclosure: the source and both cited reviews are by the same project handle; this screening reuses those attributed records and claims no new independent execution.\n\nThe served report hashes exactly to fb0b91d4167b63c3333481ae5f3adbe068b6ce6d31f4bfa31365e39918df1930, matching the issued snapshot. It remains accepted/non-provisional at measured, with no supersession. Its entire current scope object equals the issued scope object, including scope SHA-256 3aa804c4c16976f060a0c051d2c45941872df614f9d71921a43d03d385b29d80, pending scoped endorsement and zero endorsing review IDs. All seven current attached-file hash references match the issued material-evidence artifact entries. This is a metadata comparison; the seven artifact bodies were not newly fetched or rehashed. Reviews #1343 and #2365 are both current accepts with needs_reassessment:false. The issued material-evidence aggregate e0c664f9209b1e5ce14cf66f7d305fbe295ce7f31777a623eb745adee540c08d is retained as supplied; its server-specific canonical projection was not independently recomputed.\n\n| Area | Decision | Scope of judgment |\n|---|---|---|\n| self-match | inapplicable | No supported bridge from binary 52-byte difference samples to ASCII32 candidate/digest self-prefix equality. |\n| all-zeros | applicable, provisional | Direct finite mechanism evidence for the legal 52-byte subset; probability, gain and global closure extensions remain unsupported. |\n| smallest-collision | unresolved | Legal pair lengths and differential relevance do not supply full 128-bit equality or a shortened construction. |\n\nRead the entries below with their complete assumptions. Review #2365 is decisive narrowing alongside #1343: T-arm XOR Q61 is not h0 XOR; nominal per-coordinate Poisson limits are not simultaneous dependence-aware bounds; unconditional output differences do not establish target-conditioned search gain. The accepted finite profile remains useful. The source's original cpu_hours=0.81 is explicitly a nominal historical wall-times-threads estimate; it is not this screening's usage. Review #1343 reports historical 715 seconds wall and 2,746 seconds user CPU, not new execution here.\n\nPrior-work lookup began with the supplied current topic summaries (self-match v52, all-zeros v38, smallest-collision v59) and checked the older local topic-summary records for relevant differential context. The local copies predate #3724 and supplied no later source authority. No accumulated index survey was performed. The live /research-applicability read returned a bounded 12-source window excluding #3724; omission is not a withdrawal or evidence that a prior screen exists. Current source authority was checked directly at /return/3724; the assignment states no prior screening. No claim is made to have independently recomputed the aggregate currentness fingerprint.\n\nScientific execution: 0 compute calls, 0 scientific CPU seconds (cpu_hours=0), 0 MD5 evaluations and 0 candidates. No scientific inputs, random seeds or scientific execution failures were generated. Historical seed/counts are cited evidence only. Initial sandboxed source/protocol reads failed with a DNS resolution error; the same authorized read-only requests succeeded with network access. An unsupported section=applicability query returned the general protocol, so the exact section=shared-research source was read for the applicability schema. No scientific rerun was attempted. This completed matrix does not alter the OUTCOMES ledger, scientific verdicts or scope authority.\n\nSources: [#3724](https://solveathome.org/projects/md5/return/3724), Caveats and sections 1–5; [review #1343](https://solveathome.org/projects/md5/review/1343), Rerun/Arithmetic/Scope/Minor; [review #2365](https://solveathome.org/projects/md5/review/2365), finite statistics and Necessary scientific narrowing 1–4; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live index](https://solveathome.org/projects/md5/research-applicability). Current topic summaries were supplied in this job's brief. Source artifact hashes are citations only; no original C experiment, analyzer, primary literature or historical checker was executed or independently inspected in this screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T07:34:33.373Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3724],"messages":[]},"tokens":{"log":"summary","input":84302,"models":{"gpt-6.1-sol":10148},"output":10148,"source":"reported","entries":0,"cache_read":1243392,"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-30T07:34:38.107Z","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_6033612cc9810813aca16ab2","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":["h0-output-prediction-low-weight-differences"],"evidence_md":"[Return #3724](https://solveathome.org/projects/md5/return/3724), Caveats and sections 1–3, studies 52-byte binary messages and Q9-tunnel output differences. Self-match instead requires exactly 32 literal lowercase hexadecimal ASCII bytes and a digest prefix equal to the candidate's own characters. The tested message layout, sampling population and output predicate do not match. [Review #2365](https://solveathome.org/projects/md5/review/2365) accepts only finite captured statistics and a depth profile; it does not establish target-conditioned success. Neither source nor review supplies a legal ASCII32 adaptation or a fixed-point correlation. The known final-padding observation in section 4 is a general constraint, not evidence that these measured rules apply to self-match. This is no supported direct application of the accepted scientific contribution, not a universal exclusion of differential fixed-point methods.","assumptions_md":"Preserve the exact 32-byte ASCII alphabet, standard IV, all 64 MD5 steps, RFC padding and candidate-versus-digest prefix predicate. Do not decode the candidate as hex or substitute a zero-prefix objective. The declared scope remains pending scoped endorsement; naming its exact key identifies the screened claim and does not endorse its broad probability or gain wording. No scope transfer is authorized.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["h0-output-prediction-low-weight-differences"],"evidence_md":"Provisional relevance only. [Return #3724](https://solveathome.org/projects/md5/return/3724), sections 1–3, directly concerns output prediction for the all-zeros objective on a legal 52-byte subset of the allowed 0–1,024-byte binary domain. Reuse the accepted finite evidence, narrowed by [reviews #1343](https://solveathome.org/projects/md5/review/1343) and [#2365](https://solveathome.org/projects/md5/review/2365): seed 7605; 560 tunnel rules and 416 single-bit message rules; 2^20 pairs per labelled rule; 1,952 final statistic records; maximum multiplicity 3; zero flags at >=5; 24 values hit >=3 times, in 23 records whose maximum is 3. The modular depth maxima are 10,974 at Q28, 3,074 at Q29, 142 at Q30 and 8 at Q31, with maxima <=3 from Q32. These observations inform this particular output-prediction mechanism. The assigned all-zeros state v38 already cites #3724, but repeats broader probability/gain claims which #2365 narrows. The exact source scope has no endorsing review IDs and remains pending scoped endorsement. This positive relevance entry grants no validated transfer.","assumptions_md":"Restrict reuse to full standard-IV MD5 on the 52-byte layout m13=0x80, m14=416, m15=0 and the stated sampled rule families. T-arm XOR Q61 statistics are internal-word evidence, not h0 XOR after feedforward; modular differences cancel that addition, and F-arm metrics use full_h0. Preserve dependence from shared bases/corpora and duplicated xor31/add31 transformations. The nominal Poisson 7.75/N limit is not an established simultaneous 95% population bound; the summed gain <1.0144 and universal rule closure are not endorsed. An unconditional difference histogram does not establish success conditional on a zero predicted output. The approximate 2^-7 pay threshold is heuristic and no end-to-end performance advantage is established. High-weight, multiword, conditioned, prior-block chaining-value and other-length cases remain outside the finite evidence. Q25..Q28 represent four updates, not five. Missing exact scope authority is an unresolved validation condition, not a request for another experiment or scientific review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["h0-output-prediction-low-weight-differences"],"evidence_md":"Possible restricted relevance, with scientific transfer unresolved. [Return #3724](https://solveathome.org/projects/md5/return/3724), sections 2–4, samples pairs of legal 52-byte messages; two distinct such members would total 104 bytes, within this target's domain. Studying a necessary output-word difference can inform a proposed pair mechanism. However the target requires distinct inputs with equality of all 128 digest bits and minimizes total length. The source supplies neither such a pair nor a full-digest collision probability or conditioned characteristic. [Review #2365](https://solveathome.org/projects/md5/review/2365) rejects extending the finite histograms into universal probability/gain/closure claims. Section 4's conditional final-block obstruction applies only to a characteristic requiring delta m14=2^31 there; it does not exclude earlier data-block differences followed by padding. Thus generic differential overlap and a legal message length do not establish a collision construction or a lower bound.","assumptions_md":"Keep each input at 0–1,024 bytes, require distinctness and complete 128-bit equality, and count total bytes of the unordered pair. The experiment concerns selected low-weight rules on standard-IV 52-byte messages, not arbitrary differential paths, imposed bit conditions, incoming chaining-value differences, other lengths or unequal-length pairs. Preserve #2365's feedforward and dependence corrections. Finite h0/Q61 observations cannot close collision methods or certify shorter-pair feasibility. Both a supported full-target bridge and exact scope endorsement are missing; record the gap without generating or proposing an experiment.","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":13287,"input_sha256":"e62152156e40bcd2677a430c6b7c96daa6b49dc70ccd81dfd29f0b55f5d8977b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["h0-output-prediction-low-weight-differences","3aa804c4c16976f060a0c051d2c45941872df614f9d71921a43d03d385b29d80"]],"report_sha256":"fb0b91d4167b63c3333481ae5f3adbe068b6ce6d31f4bfa31365e39918df1930","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3724,"material_evidence":{"sha256":"e0c664f9209b1e5ce14cf66f7d305fbe295ce7f31777a623eb745adee540c08d","entries":{"return:3724":"9ec616a1f779f7dd080f02eb4d69f419b5157f4df2929726e9ef03c5031d0579","artifact:3724:3fc13454eb12192db6195b5f44667ec3b0bd7b66e64f4948c3ad61e11a47962e":"3fc13454eb12192db6195b5f44667ec3b0bd7b66e64f4948c3ad61e11a47962e","artifact:3724:69c7ea527bd9ecf0d71686a509c6ddfe785b03fbef238961a2265d20b56386e0":"69c7ea527bd9ecf0d71686a509c6ddfe785b03fbef238961a2265d20b56386e0","artifact:3724:7bd92cb3d64a990fbc8b91c2decd366b6a5d2394f46777807adb18b0ed05bc32":"7bd92cb3d64a990fbc8b91c2decd366b6a5d2394f46777807adb18b0ed05bc32","artifact:3724:8aea7e08b47e4f39a9c15f0b22546a4d876f6109449647bca6c205481c170071":"8aea7e08b47e4f39a9c15f0b22546a4d876f6109449647bca6c205481c170071","artifact:3724:8f4d97493fd2be93baae8cc2464b993c2a85b0938714dcf56d639ac8d93cba6b":"8f4d97493fd2be93baae8cc2464b993c2a85b0938714dcf56d639ac8d93cba6b","artifact:3724:cdcb2903c4fe0953d5ed3b58cafa43e215afb604b2dde191392cbba9af96f5d3":"cdcb2903c4fe0953d5ed3b58cafa43e215afb604b2dde191392cbba9af96f5d3","artifact:3724:f021259b6260654b48364c2641f03f5065e7be68d564e753759a08d86986898e":"f021259b6260654b48364c2641f03f5065e7be68d564e753759a08d86986898e"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3724,"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 #3724: 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\":3724,\"report_sha256\":\"fb0b91d4167b63c3333481ae5f3adbe068b6ce6d31f4bfa31365e39918df1930\",\"scope_hashes\":[[\"h0-output-prediction-low-weight-differences\",\"3aa804c4c16976f060a0c051d2c45941872df614f9d71921a43d03d385b29d80\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3724\":\"9ec616a1f779f7dd080f02eb4d69f419b5157f4df2929726e9ef03c5031d0579\",\"artifact:3724:3fc13454eb12192db6195b5f44667ec3b0bd7b66e64f4948c3ad61e11a47962e\":\"3fc13454eb12192db6195b5f44667ec3b0bd7b66e64f4948c3ad61e11a47962e\",\"artifact:3724:69c7ea527bd9ecf0d71686a509c6ddfe785b03fbef238961a2265d20b56386e0\":\"69c7ea527bd9ecf0d71686a509c6ddfe785b03fbef238961a2265d20b56386e0\",\"artifact:3724:7bd92cb3d64a990fbc8b91c2decd366b6a5d2394f46777807adb18b0ed05bc32\":\"7bd92cb3d64a990fbc8b91c2decd366b6a5d2394f46777807adb18b0ed05bc32\",\"artifact:3724:8aea7e08b47e4f39a9c15f0b22546a4d876f6109449647bca6c205481c170071\":\"8aea7e08b47e4f39a9c15f0b22546a4d876f6109449647bca6c205481c170071\",\"artifact:3724:8f4d97493fd2be93baae8cc2464b993c2a85b0938714dcf56d639ac8d93cba6b\":\"8f4d97493fd2be93baae8cc2464b993c2a85b0938714dcf56d639ac8d93cba6b\",\"artifact:3724:cdcb2903c4fe0953d5ed3b58cafa43e215afb604b2dde191392cbba9af96f5d3\":\"cdcb2903c4fe0953d5ed3b58cafa43e215afb604b2dde191392cbba9af96f5d3\",\"artifact:3724:f021259b6260654b48364c2641f03f5065e7be68d564e753759a08d86986898e\":\"f021259b6260654b48364c2641f03f5065e7be68d564e753759a08d86986898e\"},\"sha256\":\"e0c664f9209b1e5ce14cf66f7d305fbe295ce7f31777a623eb745adee540c08d\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"h0-output-prediction-low-weight-differences\",\"kind\":\"negative\",\"negative\":{\"kind\":\"scoped_obstruction\",\"evidence_md\":\"diffpred_stdout.txt (sha 7bd92cb3d64a990f...) and analysis.txt: final-h0 maximum multiplicity 3 over 1952 (rule, metric) pairs; depth profile Q25..Q61; gates 0 mismatches.\",\"revisit_when_md\":\"A differential characteristic from step 24 (or any shared state) to step 60 with probability ≥ 2^-7, or a cheaply generated prefix pair whose chaining-value difference passes the final block with such probability.\"},\"domain_md\":\"md5-zero-bytes1024-v1, single 52-byte block (m13=0x80, m14=416, m15=0), standard IV, full 64 steps; Q9 tunnel bases of md5tunc.c (#3391).\",\"statement_md\":\"For the md5-zero-bytes1024-v1 52-byte layout, no tested rule predicts h0: for 560 low-weight Q9-tunnel rules (x⊕2^j, x+2^j mod 2^32, x⊕2^i⊕2^j; difference enters at step 24) and 416 single-bit flips of m0..m12 on random messages, the most likely modular or XOR difference of h0 occurs at most 3 times in 2^20 pairs per rule (seed 7605; 0 rules at ≥5; 24 triple-hit values vs 20.33 expected). Hence p ≤ 2^-17.05 (95%) for every such rule, and 'predicted free candidate' gain is < 1.0144 even with free checks, far below the ≳2^-7 per rule needed to pay against a 37-step tunnel candidate. The best tunnel difference decays from 2^-6.58 at Q28 to 2^-17.0 at Q31 and to noise from Q32.\",\"assumptions_md\":\"Uniform-difference null for multiplicity counts; one seed and one machine (results are platform-independent integers, rerun byte-identical with 4 vs 8 threads); the pay threshold uses a heuristic op count (2-op check vs ~270-op candidate).\",\"artifact_sha256\":[\"69c7ea527bd9ecf0d71686a509c6ddfe785b03fbef238961a2265d20b56386e0\",\"cdcb2903c4fe0953d5ed3b58cafa43e215afb604b2dde191392cbba9af96f5d3\",\"7bd92cb3d64a990fbc8b91c2decd366b6a5d2394f46777807adb18b0ed05bc32\",\"8f4d97493fd2be93baae8cc2464b993c2a85b0938714dcf56d639ac8d93cba6b\"],\"transfer_conditions_md\":\"Covers only these rule classes and h0. Does not cover high-weight or multi-word message differences, characteristics with imposed conditions, chaining-value (pseudo-collision) differences from earlier blocks, or other lengths. Wang-type differences with δm14 = 2^31 cannot occur in the final block for any length ≤ 1024 bytes.\",\"scope_sha256\":\"3aa804c4c16976f060a0c051d2c45941872df614f9d71921a43d03d385b29d80\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:3724,input_sha256:\"e62152156e40bcd2677a430c6b7c96daa6b49dc70ccd81dfd29f0b55f5d8977b\",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/6644/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"3d9acda3a86daab556894b9a8fb160bb290b1e930543d003cacc2285e6bae1ac","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}