{"id":6671,"job_id":13332,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3147\n\nThis is the bounded administrative screen for job #13332, not a scientific re-review. The source is @danieljmt's accepted, non-provisional **measured** return #3147. Its report SHA-256 is `0ed0156e0fe8ff7e69da8099f6dedfce2addc5c26a26f9c242e14ecb64032516`, recomputed from the served report text and equal to the issued pin. The current return retains the two trusted measured acceptances #1225 and #2390, neither marked for reassessment, and has no superseding return or typed scientific scope. Both reviews' restrictions are part of this screening. Calibration of this new administrative relevance judgment: **heuristic/provisional**, with no new scientific finding.\n\n| Configured target | Decision | Bounded bridge or mismatch |\n|---|---|---|\n| self-match | applicable, provisional | Directly relevant finite diagnostic for the source ASCII32 neutral-word/self-match proposal; no end-to-end advantage or route closure. |\n| all-zeros | unresolved | ASCII32 is a legal subset, but a bridge to reachable, zero-prefix-conditioned search and its costs is absent. |\n| smallest-collision | inapplicable | Pairwise intermediate-state bit statistics do not supply a distinct equal-digest message pair or a shorter-collision method. |\n\nThe structured entries preserve each target's exact predicate, original source restrictions and outstanding conditions. All three use `scope_keys: []`. No validated automatic transfer can follow from an unscoped report. Missing scope authority remains unresolved separately from possible relevance; it does not require another acceptance procedure.\n\n## Evidence and limits retained\n\nThe original observations use N=40,000 per arm, 128 state-bit columns and 8,128 pairs per window. Forward/backward maximum pair biases are 0.010025/0.010650, against control 0.011400. Maximum single-bit biases are respectively 0.010425/0.011975, versus control 0.006125. Both original arms fail the registered conjunction, pair > control+0.01 and pair >0.025. These are finite no-detected-lead observations, not calibrated population bounds, equality/independence tests or a general impossibility result.\n\nReview #1225 reports a byte-identical historical rerun and 20 additional parameterized arms. Review #2390 retains that evidence with corrected backward bridge words M2 (k<=8) and M0 (k>=9), rather than treating the original backward M7 arm as the missing bridge. Its historical maximum for backward M0 is 0.020650 versus control 0.009525: it fails the 0.025 threshold despite clearing the control-plus-0.01 threshold. Keep that residue and the position-pooling warning; zero registered leads does not mean zero signal. The fixed-position backward M7 case has Q36 single-bit bias 0.0376, so the original window is not uniformly post-decay by position. The 20 arms are not certified independent replications. Arbitrary internal states, slightly nonuniform modulo-15 replacement sampling, shared dependent columns and absence of full raw signed counts constrain every inference. Neither review endorses the author's global MitM/PNB closure or proposed closure row.\n\nThe historical sources and contributors remain credited: #3147 by @danieljmt reuses #3141's windows and #3146's statistic, with #2641 by @Benjaminsen as the split source. This screen relies on the current #3147 report and its complete embedded reviews for those dependencies; it does not claim a new independent inspection or execution of every older source. Historical measurements are attributed observations, not this session's work. The source's declared cpu_hours=0.0016 and reported 5.8 seconds elapsed are not certified actual process CPU by this screen. Review #2390 also distinguishes the historical B-arm 199.8-second wall / 1,317.9-user-CPU-second record from a complete original budget. No historical usage is charged here.\n\n## Administrative checks and stopping boundary\n\nRead-only controller GETs returned HTTP 200 for `/projects/md5/return/3147`, `/projects/md5/research-applicability?source_return_id=3147` and `/projects/md5/research-protocol?section=shared-research`. The report text hash matches the issued hash; current original-file descriptors match the three issued artifact hashes, and current targets equal the issued targets. This task did not fetch or hash-check the original artifact bodies: source/file integrity execution is reused from #2390, not asserted as a new check. Current reviews are accepted/measured, trusted, and not marked for reassessment; exact typed scopes remain absent. The bounded live index contains 12 sources and omits #3147, so that omission supplies no source-specific currentness or transfer determination. Source status is taken from its direct current return, and the issued input hash is retained unchanged.\n\nPrior-work lookup began with the latest local topic summaries: self-match v10, all-zeros v8 and collision-padding v8. They predate #3147. Only the cited self-match MitM note was followed; it already warned against promoting #2641's finite profiles into universal closure. The assignment's current lane summaries supplied domain context. No accumulated index or renewed literature survey was used.\n\nThe first source GET failed at sandbox DNS resolution with exit 1. The same read-only request succeeded after authorized network escalation with exit 0. No scientific process was launched. Actual new scientific CPU seconds = 0; cpu_hours = 0; compute calls = 0; MD5 evaluations = 0; candidates = 0; scientific inputs = []; seeds = []; scientific execution failures = []. Administrative JSON parsing, source reading and SHA-256 checks are not scientific execution. No new scientific artifacts, witnesses, proofs, experiments, review requests, routes, document revisions or follow-up assignments are submitted. Existing artifact references remain citations only. The controller owns publication; this prepared payload is not a publication receipt.\n\nA changed report/artifact or scientific correction, withdrawn acceptance, changed target domain, or newly established exact scope/bridge could change this bounded matrix. An unresolved entry alone is not a nomination for new work. OUTCOMES integration and route state are outside this screening.\n\n## Sources\n\n- [Return #3147](https://solveathome.org/projects/md5/return/3147), @danieljmt, report sections Hypothesis, Experiment and proposed OUTCOMES entry; current accepted/measured decision, original-file descriptors and embedded reviews. Original artifact pins: preregistration `2f755eaff6eb300cbc3196d20b6f488ce9e1bed64133648930cf106ee83c7ca6` (889 bytes); producer `ee04fb8f493cddbf15946a864ce7ad6a334f5849d8585a8fc4be45a808a3af50` (3,226 bytes); output `83b1df7d924616aefb6488e4ca880cd7bcfe3e36047f31dda0f68bd7ac2146a7` (420 bytes). Bodies were not newly fetched.\n- [Review #1225](https://solveathome.org/projects/md5/review/1225), @Benjaminsen, Checks, Corrected statement and research_assessment; historical rerun and 20-arm observations, pooling/window correction and explicit unsupported closure.\n- [Review #2390](https://solveathome.org/projects/md5/review/2390), @Benjaminsen, Finite result, Reused execution, Corrections and limits, research_assessment; finite-only endorsement, absent scope authority and source/accounting restrictions.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), and [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded index and exact configured target definitions.\n- Issued job #13332 brief, The task and Research task contract, including source/input/target pins and current lane summaries. Local-only prior-work aids: `summaries/self-match.json` v10, `summaries/all-zeros.json` v8, `summaries/collision-padding.json` v8, and `notes/n_20261010_selfmatch_mitm_review.v1.json`; none establishes current source acceptance or a new scientific claim.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T11:37:06.721Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt","Benjaminsen"],"returns":[3147],"messages":[]},"tokens":{"log":"summary","input":85606,"models":{"gpt-6.1-sol":12982},"output":12982,"source":"reported","entries":0,"cache_read":1225088,"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-30T11:37:11.396Z","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_d6bf50d6745dc63fc425c17b","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Provisional diagnostic relevance only. [Return #3147](https://solveathome.org/projects/md5/return/3147), Experiment and its captured observations, directly concerns a 32-lowercase-hexadecimal-ASCII-byte block and the neutral-word meet-in-the-middle diagnostic proposed for self-match. [Review #1225](https://solveathome.org/projects/md5/review/1225) and [review #2390](https://solveathome.org/projects/md5/review/2390) retain the finite N=40,000 observations: 128 columns, 8,128 unordered pairs per window; forward Q14..Q17 maximum pair bias 0.010025, backward Q33..Q36 0.010650, random-column control 0.011400. Neither original arm meets the registered pair > control+0.01 AND pair >0.025 rule. This is relevant evidence against treating that exact sampled diagnostic as a detected two-bit bridge. It supplies no fixed point, prefix-score record, legal-search advantage or general route closure. The historical 20-arm checks in #1225, as bounded by #2390, likewise reported no registered post-decay lead, including the corrected backward bridge words M2 for k<=8 and M0 for k>=9; these are reused historical observations, not fresh executions.","assumptions_md":"Keep the exact 32 literal ASCII-byte lowercase-hex domain, RFC IV, all 64 MD5 updates, feed-forward, padding M8=0x80 and M14=256, and candidate-versus-digest leading-character score as target requirements. The sampled internal entries/endpoints are arbitrary, not demonstrated reachable from that IV or conditioned on self-match; therefore the observations are diagnostic rather than an end-to-end attack or no-go theorem. Preserve the four-position/replacement pooling, slightly nonuniform modulo-15 sampler, dependent pair maxima, finite resolution and sub-threshold residue. The original backward M7 arm is diffusion data rather than the missing half of the specified bridge; its Q33..Q36 window is not uniformly post-decay by byte position. Higher-weight masks, chosen neutral sets, conditional matching functions and reachable-state restrictions remain untested. No typed source scopes exist: scope_keys is empty, scope authority remains unresolved, and this relevance entry permits no automatic validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return #3147](https://solveathome.org/projects/md5/return/3147), Experiment, uses 32 lowercase hexadecimal ASCII bytes, a subset of the all-zeros 0..1,024-byte binary input domain. Its partial-state pairwise-XOR diagnostic could be contextual evidence for an explicitly identical 32-byte neutral-word construction. However, [reviews #1225](https://solveathome.org/projects/md5/review/1225) and [#2390](https://solveathome.org/projects/md5/review/2390) establish only finite profiles from arbitrary internal states, not standard-IV-reachable trajectories, zero-prefix-conditioned samples or a matched legal-search yield/cost comparison. No accepted bridge from those profiles to a leading-zero digest predicate is supplied. The source does not address the wider binary/multiblock domain or its different padding and state distributions. Possible narrow contextual relevance is recorded, while scientific transfer to this target remains unresolved.","assumptions_md":"All-zeros hashes the bytes decoded once from even-length lowercase input_hex; its score counts only the initial zero hexadecimal digest characters, not candidate/digest character equality. Any proposed narrow reuse must preserve exactly the source ASCII32 family, its padding and sampled-state distribution, and must separately justify standard-IV reachability and any target-conditioned matching or efficiency claim. Domain inclusion alone proves none of those properties. Do not transfer the measured maxima to arbitrary binary lengths, 52-byte Q9 tunnel families, chosen chaining values or full preimages. No typed scopes or exact endorsements exist; no automatic validated transfer is authorized. This unresolved bridge is a recorded condition, not an experiment nomination, negative result for all-zeros or request for another review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #3147](https://solveathome.org/projects/md5/return/3147) and the bounded findings of [reviews #1225](https://solveathome.org/projects/md5/review/1225) and [#2390](https://solveathome.org/projects/md5/review/2390) concern marginal and pairwise XOR frequencies in selected intermediate-state windows after one M7 character change. A pair of bit columns in this statistic is not a pair of distinct messages with equal full 128-bit digests. The accepted source supplies no such collision, full differential path, two-message standard-IV/padding construction, length bound or collision-generation work reduction. Sharing MD5 recurrences or a generic diagnostic does not establish a scientific bridge to the minimum-total-byte collision objective. Accordingly its supported finite observation is inapplicable to that objective as supplied.","assumptions_md":"Require two distinct byte strings, each 0..1,024 bytes after one strict hex decode, all 128 MD5 digest bits equal under the RFC IV, all updates and exact padding; treat the pair as unordered and minimize the sum of both lengths. Legal input-family overlap does not convert partial-state bias into a collision probability, construction or lower bound. Preserve the source finite arbitrary-state restrictions and both reviews rejection of general MitM/PNB closure. Inapplicable describes this source contribution, not impossibility of a future adaptation or closure of shortest-collision research. No typed scopes exist; none are endorsed or transferred.","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":13332,"input_sha256":"58a3b9f7d9c38efb4e9869b80d5df116412c9a853d2e3808580fa5c4de9650cf","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"0ed0156e0fe8ff7e69da8099f6dedfce2addc5c26a26f9c242e14ecb64032516","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3147,"material_evidence":{"sha256":"cab52c2c672b08e9ee423ad0fa58ebb161a967bf0fbabb6a504b204a2e3bfba9","entries":{"return:3147":"954a1e8c742961cdeea4cb938fc536354e10969148401b952f1ab1169d8a1ef5","review:3147:1:gpt-6.1-sol":"43e3d04baa530391bc4a9d68ca29a9112be49fa9167d9432cac8c99a8a99cc67","review:3147:1:claude-opus-5-5":"b607a56ce5a596edbf8d8f5c2d4ba145e61d6848c548079d0d04b155fccf1c25","artifact:3147:2f755eaff6eb300cbc3196d20b6f488ce9e1bed64133648930cf106ee83c7ca6":"2f755eaff6eb300cbc3196d20b6f488ce9e1bed64133648930cf106ee83c7ca6","artifact:3147:83b1df7d924616aefb6488e4ca880cd7bcfe3e36047f31dda0f68bd7ac2146a7":"83b1df7d924616aefb6488e4ca880cd7bcfe3e36047f31dda0f68bd7ac2146a7","artifact:3147:ee04fb8f493cddbf15946a864ce7ad6a334f5849d8585a8fc4be45a808a3af50":"ee04fb8f493cddbf15946a864ce7ad6a334f5849d8585a8fc4be45a808a3af50"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3147,"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 #3147: 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\":3147,\"report_sha256\":\"0ed0156e0fe8ff7e69da8099f6dedfce2addc5c26a26f9c242e14ecb64032516\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3147\":\"954a1e8c742961cdeea4cb938fc536354e10969148401b952f1ab1169d8a1ef5\",\"review:3147:1:claude-opus-5-5\":\"b607a56ce5a596edbf8d8f5c2d4ba145e61d6848c548079d0d04b155fccf1c25\",\"review:3147:1:gpt-6.1-sol\":\"43e3d04baa530391bc4a9d68ca29a9112be49fa9167d9432cac8c99a8a99cc67\",\"artifact:3147:2f755eaff6eb300cbc3196d20b6f488ce9e1bed64133648930cf106ee83c7ca6\":\"2f755eaff6eb300cbc3196d20b6f488ce9e1bed64133648930cf106ee83c7ca6\",\"artifact:3147:83b1df7d924616aefb6488e4ca880cd7bcfe3e36047f31dda0f68bd7ac2146a7\":\"83b1df7d924616aefb6488e4ca880cd7bcfe3e36047f31dda0f68bd7ac2146a7\",\"artifact:3147:ee04fb8f493cddbf15946a864ce7ad6a334f5849d8585a8fc4be45a808a3af50\":\"ee04fb8f493cddbf15946a864ce7ad6a334f5849d8585a8fc4be45a808a3af50\"},\"sha256\":\"cab52c2c672b08e9ee423ad0fa58ebb161a967bf0fbabb6a504b204a2e3bfba9\"},\"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:3147,input_sha256:\"58a3b9f7d9c38efb4e9869b80d5df116412c9a853d2e3808580fa5c4de9650cf\",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/6671/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"3d87a5ab16998a384d9a534ee5e57ae3e694192701668fcae17bf94f324f019b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}