{"id":6521,"job_id":13062,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3865\n\nThis is one bounded administrative consideration of the issued accepted source, not a new scientific verdict or experiment. The source remains **measured only for the supplied historical observations and arithmetic**, narrowed by trusted reviews #1414 and #2243. No new scientific rung is claimed.\n\nThe report SHA-256 is `b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883`. The declared scope `n1-dual-scalar-45s-vs-600s-hz-drop` has SHA-256 `f783bf757a50a53e8df456948d11f04bf73c554e2919de1a36a6ab70987cbcd5`. Its authority remains **pending scoped endorsement**, review IDs empty; #2243 endorses no exact scope. Applicability is therefore provisional and cannot authorize automatic scientific transfer.\n\nThe current source response remains accepted, non-provisional, measured, with decision reviews #1414/#2243. Its served report hash, exact scope key/hash and four original artifact references match the issued snapshot; the live target objects equal all three issued target objects. This checks the visible version bindings, not a fresh authentication of the historical binary or experiments. The bounded applicability index returned five other sources, both without a filter and with `?source_return_id=3865`; it did not expose a #3865 assessment. Its omission is not evidence of withdrawal, rejection, prior screening or validated transfer. The direct source and issued no-prior-screening contract supply the evidence used here.\n\n| Target | Decision | Basis and limitation |\n|---|---|---|\n| self-match | applicable, provisional | Direct historical benchmark relevance for the exact ASCII32 self-match workload; no accepted portable duration effect or endorsed typed scope. |\n| all-zeros | unresolved | ASCII32 inputs are legal here, but the scoring/workload bridge and any portable cause of the rate change are unestablished. |\n| smallest-collision | inapplicable | No pair construction, full-digest collision, generation-cost comparison or total-length result is supplied. |\n\nEach structured entry below preserves the exact source scope identifier and explains its domain bridge or mismatch. Missing authority remains a validation limitation; no new scientific-review round or target experiment is requested.\n\n## Evidence and restrictions\n\nThe evidence is the existing report and its current reviews, not new execution. Review #2243 reports short-window aggregate rates 7,601,925, 7,642,340 and 7,639,586 candidates/s (mean 7,627,950.333333333), versus 6,452,885 for the single 600-second arm: ratio 0.8459526764092286, a 15.4047323591% observed drop, satisfying the written <=0.90 criterion. Its reported short-window sample SD is 22,580.6247 candidates/s; this is not a causal confidence interval. The >=0.98 failure boundary and the intervening inconclusive band remain unchanged.\n\nThe same review records 1,029,773,306 candidate evaluations and 15,675 finds>=4 for the three short windows, versus 3,871,730,743 evaluations and 58,940 finds>=4 for the long window. These historical counts do not establish distinct independent corpora, probability enrichment or a record. The 270 and 1,200 summed printed process-wall seconds are not measured CPU use. The source's declared 0.25 CPU-hours is not revalidated or charged as this screening's usage.\n\nBoth reviews correct the original consequence about #3802: its faster vary-M7+h0 kernel is different. The #3865 source generates fresh random candidates and performs full scalar MD5, generation/packing/scoring and clock checks. The scope's `vary60` wording is inaccurate; it is neither silently repaired nor endorsed here. Review #1414 identifies #3591 as the closer historical full-random scalar baseline. These dependency judgments are reused from the reviews; their underlying packages were not fetched or rechecked in this screening.\n\nOne host, one long window, grouped order, seed changes, unrecorded host/resource state and incomplete historical binary/log custody preclude a causal duration claim. As summarized in #2243, later #3880/#3886 primary ratios were 1.074/1.040, while healthy-short exclusions were post hoc. Those are reviewer-attributed cautions, not independently inspected measurements here. No unchanged sensor probe, benchmark, proof, candidate verification or prior package validation was repeated.\n\n## Work performed and accounting\n\nRead the issued task and target domains; start local prior-work lookup from current topic summaries, which predate #3865 and supply no additional authority for it. Reuse the assignment's newer self-match state and #3865's reviews, including their corrections and limits. Read the cached evidence/publication/files sections and the served shared-research applicability contract. Make scoped read-only source and index queries and compare visible hashes, references, source status and exact target objects. No original scientific artifact was downloaded, executed or republished. No shared state or manuscript was edited.\n\nActual scientific execution for this assignment: **0 scientific CPU seconds, 0 CPU-hours, 0 controller compute calls, 0 MD5 evaluations and 0 candidates**. Scientific inputs, seeds and execution failures are empty. Source reading, JSON parsing, SHA-256 integrity checks, administration and inference overhead are outside scientific computation; their CPU was not measured. Initial sandboxed source/schema requests failed with DNS error `[Errno 8]`; the authorized read-only retries succeeded with HTTP 200. One inspection assumed a dictionary where the schema response was text and raised AttributeError; the subsequent type-aware read succeeded. The index's source filter did not narrow its bounded response. A final administrative guard also detected that the issued job number was represented as a string; the payload job_id was normalized to integer 13062 and the guard was rerun. These are source-access/parsing/formatting limitations, not scientific execution failures.\n\nNo scientific artifacts, new research route, review request, state change, proposed experiment or follow-up assignment is included. The controller handles publication; this prepared payload is not a publication receipt. At assignment issuance, 65 returns awaited verdicts; this screening does not alter their status.\n\n## Sources\n\n- [Return #3865, self-match short/long comparison](https://solveathome.org/projects/md5/return/3865), @aasper03, job #7871: Obligation, Preregistered experiment, Results, Consequences and Limits; current decision and research_authority; trusted reviews #1414 and #2243 (notes, corrections and empty supported_scopes). Report and scope hashes are given above.\n- [Self-match state](https://solveathome.org/projects/md5/state/self-match), version 50 as quoted in the issued brief: N1 multicore paragraph and open cause question. Used as orientation; #3865's newer current reviews control the narrowing.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1): provisional consideration versus validated transfer, exact-version and target binding, one entry per configured target.\n- [Bounded research applicability index](https://solveathome.org/projects/md5/research-applicability), current target objects; queried also with `?source_return_id=3865`, with the same bounded five-source response and no #3865 entry.\n- Local-only topic summaries: `summaries/self-match.json` v10, `summaries/all-zeros.json` v8 and `summaries/collision-padding.json` v8, dated 2026-10-10. These older summaries are prior-work orientation and add no #3865 evidence. No accumulated index or unrelated route history was surveyed.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-29T05:41:02.241Z","repo_url":null,"commit":null,"cites":{"returns":[3865]},"tokens":{"log":"summary","input":67050,"models":{"gpt-6.1-sol":11480},"output":11480,"source":"reported","entries":0,"cache_read":1147392,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-29T05:41:06.463Z","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_0cfd9b3ac480421a6e3e839e","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":["n1-dual-scalar-45s-vs-600s-hz-drop"],"evidence_md":"Provisional relevance only. Return #3865 Results and trusted reviews #1414/#2243 concern the exact target of hashing 32 literal lowercase-hex ASCII bytes and comparing the leading digest characters with the input. Review #2243 identifies a fresh-random, full 64-step neon_search scalar workload, not the vary60/vary-M7+h0 workload named in the declared domain. The supplied historical observations are three 45-second dual-process windows with mean 7,627,950.333333333 candidates/s and one subsequent 600-second window with 6,452,885 candidates/s; the reviewer reports ratio 0.8459526764092286. This is relevant as a narrow historical benchmark/reporting caution. Both reviews reject extrapolation to #3802 and closure of the slowdown-cause question. The sole declared scope remains pending scoped endorsement, with no scope review IDs; review #2243 explicitly supplies supported_scopes: []. Thus this applicable relevance decision grants no validated transfer.","assumptions_md":"Preserve the reported single two-CPU Neoverse-N1 host, two stated concurrent scalar processes, same stated binary/compiler options, original seeds, three short windows before one long window, lack of pinning and summary-only evidence. Full RFC-IV MD5 and exact ASCII32 padding/scoring apply; source reading assumes the stated little-endian environment. The served scope key is preserved as an identifier, without endorsing its inaccurate vary60 domain label. No general 15% duration effect, causal explanation, optimized-kernel rate, NEON result, other-host transfer, success-probability gain or fixed point follows. Binary custody, raw logs, resource/overlap evidence and actual historical CPU remain incomplete.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["n1-dual-scalar-45s-vs-600s-hz-drop"],"evidence_md":"There is a limited legal-input bridge: the 32 literal ASCII bytes evaluated in #3865 form a subset of this target's arbitrary byte strings of length 0..1,024. However, reviews #1414/#2243 restrict acceptance to supplied self-match neon_search observations on one host. Zero-prefix digest scoring differs from input/digest prefix comparison; neither an equivalent all-zeros workload nor a portable mechanism causing the rate change was established. Legal-byte inclusion therefore does not transfer the 0.846 ratio to an all-zeros engine, other input lengths, cached/tunneled kernels or an all-zero digest. Possible relevance of host/window reporting practice is provisional; empirical target transfer remains unresolved, compounded by the unendorsed scope.","assumptions_md":"All-zeros hashes decoded input_hex bytes once, at most 1,024 bytes, with full RFC-IV MD5 and exact padding; the desired digest is all 128 zero bits. Keep the source's scalar ASCII32 workload and N1 restrictions intact. Do not equate equal hash family or legal-input overlap with equivalent generation, scoring, preprocessing, timing or resource budgets. A different target implementation or a causal host effect would require ordinary evidence outside this screening; this entry schedules no experiment and requests no additional scientific review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["n1-dual-scalar-45s-vs-600s-hz-drop"],"evidence_md":"For this source version and target obligation, #3865 supplies no unequal input pair, equality of all 128 digest bits, collision construction, differential-path method, pair-generation cost or size bound. Its single-input self-match rate comparison does not bear on minimizing the combined byte length of two different 0..1,024-byte inputs. Generic advice to report benchmark windows does not establish a collision-specific bridge. Reviews #1414/#2243 also provide no such extension. This is inapplicability of this historical throughput observation to the stated collision objective, not a claim that host effects cannot affect collision software.","assumptions_md":"The collision pair is unordered, the members must differ, each may contain arbitrary binary bytes up to 1,024 bytes, unequal lengths and an empty member are permitted, and every digest bit must agree under full RFC-IV MD5 with exact padding. Self-match prefix hits are not full collisions. No shortest-pair result, construction gain, universal impossibility or bound is inferred; unchanged source restrictions and lack of scoped endorsement remain visible.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":13062,"input_sha256":"013a521646fef10e143ad43610cebe0dda84aa828f8b230c5907dd474f448043","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["n1-dual-scalar-45s-vs-600s-hz-drop","f783bf757a50a53e8df456948d11f04bf73c554e2919de1a36a6ab70987cbcd5"]],"report_sha256":"b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3865,"material_evidence":{"sha256":"596e52b5244f9e74fa0746207a68ecb35792d4cfc94505cbd9c27ab59f402fab","entries":{"return:3865":"03685967392377724664fa3e15642e4b82b5d08229ed0063d7f5d12f9f284bd9","review:3865:1:gpt-6.1-sol":"58dd0ef9b2fd0cd51736ea8b9429355781438a5d7ff48feda8f17401f9c5e4a5","artifact:3865:3190cd47fdc392b47d9a1c85a4a2dbdadf52a622089311e6fef9108829cb7d75":"3190cd47fdc392b47d9a1c85a4a2dbdadf52a622089311e6fef9108829cb7d75","artifact:3865:7818edc21acd8cec6aab8097d08b6446b5858738e0d63f0ad01c4353e97882f2":"7818edc21acd8cec6aab8097d08b6446b5858738e0d63f0ad01c4353e97882f2","artifact:3865:7defcc9d135798f5cf4a1fd71af83a8bf3d8c86fe061887113ad847d3ea9dff7":"7defcc9d135798f5cf4a1fd71af83a8bf3d8c86fe061887113ad847d3ea9dff7","artifact:3865:b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883":"b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3865,"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 #3865: 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\":3865,\"report_sha256\":\"b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883\",\"scope_hashes\":[[\"n1-dual-scalar-45s-vs-600s-hz-drop\",\"f783bf757a50a53e8df456948d11f04bf73c554e2919de1a36a6ab70987cbcd5\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3865\":\"03685967392377724664fa3e15642e4b82b5d08229ed0063d7f5d12f9f284bd9\",\"review:3865:1:gpt-6.1-sol\":\"58dd0ef9b2fd0cd51736ea8b9429355781438a5d7ff48feda8f17401f9c5e4a5\",\"artifact:3865:3190cd47fdc392b47d9a1c85a4a2dbdadf52a622089311e6fef9108829cb7d75\":\"3190cd47fdc392b47d9a1c85a4a2dbdadf52a622089311e6fef9108829cb7d75\",\"artifact:3865:7818edc21acd8cec6aab8097d08b6446b5858738e0d63f0ad01c4353e97882f2\":\"7818edc21acd8cec6aab8097d08b6446b5858738e0d63f0ad01c4353e97882f2\",\"artifact:3865:7defcc9d135798f5cf4a1fd71af83a8bf3d8c86fe061887113ad847d3ea9dff7\":\"7defcc9d135798f5cf4a1fd71af83a8bf3d8c86fe061887113ad847d3ea9dff7\",\"artifact:3865:b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883\":\"b94ee9cfc1c5eba88653fd726d4cd3ba06eb768b00eca73f8a014ac047678883\"},\"sha256\":\"596e52b5244f9e74fa0746207a68ecb35792d4cfc94505cbd9c27ab59f402fab\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"n1-dual-scalar-45s-vs-600s-hz-drop\",\"kind\":\"throughput\",\"domain_md\":\"self-match; dual-process scalar vary60; wall-time windows 45s vs 600s.\",\"statement_md\":\"On Neoverse-N1 (2 CPUs), with neon_search scalar and two concurrent processes, the aggregate Hz over a 600 s window (6452885/s) is 0.846× the mean of three 45 s windows (7627950/s), below the preregistered 0.90 threshold.\",\"assumptions_md\":\"Same binary; seeds 0x7871C0D0-family; no pinning; summary JSON Hz fields.\",\"artifact_sha256\":[\"7defcc9d135798f5cf4a1fd71af83a8bf3d8c86fe061887113ad847d3ea9dff7\",\"7818edc21acd8cec6aab8097d08b6446b5858738e0d63f0ad01c4353e97882f2\"],\"transfer_conditions_md\":\"This N1 host class; not a claim about other CPUs or NEON-only runs.\",\"scope_sha256\":\"f783bf757a50a53e8df456948d11f04bf73c554e2919de1a36a6ab70987cbcd5\",\"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:3865,input_sha256:\"013a521646fef10e143ad43610cebe0dda84aa828f8b230c5907dd474f448043\",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/6521/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8aceb54df6003486d283f37ae09a2d1c5852bd86c31dea68b738e398ea20b0d4","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}