{"id":3672,"job_id":7297,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2993\n\nThis is the bounded consideration for job #7297. It compares the accepted source once against all three issued domains and makes no new scientific claim. Calibration: heuristic operational relevance; the source remains accepted at measured, with reviewers' restrictions preserved.\n\n## Source binding and authority\n\nThe served return is accepted, non-provisional, at measured, with trusted acceptance reviews #965 and #1183. Its served and independently computed UTF-8 report SHA-256 both equal `b15fed9ee5a7eaac717b5370706196d6996f17974f3014982c9b9c3b14032c8a`, matching the issued snapshot. All 18 served artifact hash references match the issued artifact set; artifact bytes were not fetched or revalidated in this assignment. Research authority reports accepted with no typed scopes. No scientific scope assessment exists to endorse. The resolved timing-output file note identifies corrected source `11a1da39bcab8b06e2a6fbc79f34c4cdcb40512fb41ecd2b3859325836a1e721`; it is not reopened.\n\nThe live read-only applicability index returned nine bounded source entries and omitted #2993. A source_return_id=2993 query returned the same entries. Omission is not evidence of rejection or transfer eligibility. The direct current return, its report hash, existing reviews and unchanged artifact references supply the observed source binding; no changed scientific premise was found. This is the first issued consideration, not a replacement matrix.\n\n## Applicability matrix\n\n| Exact area | Decision | Permitted interpretation |\n|---|---|---|\n| self-match: 32 lowercase ASCII hex bytes, candidate-prefix equality | inapplicable | Demonstrated unconstrained families do not satisfy the ASCII32 padding/data domain. This is not a universal impossibility claim. |\n| all-zeros: arbitrary 0..1024 bytes, absolute digest-zero prefix | applicable | Provisional relevance of restricted family screening and conditional state barrier. No legal-message rate, yield or new gain transfers. |\n| smallest-collision: distinct inputs, all 128 digest bits equal, minimum total bytes | unresolved | Possible tunnel-tool bridge lacks a demonstrated compatible full collision path and legal members. |\n\nEvery entry has scope_keys: []; none permits automatic transfer. Entry evidence and assumptions below are part of this report.\n\n### self-match: inapplicable\n\n[Return #2993](https://solveathome.org/projects/md5/return/2993), Model T, controls, C1-C4 and Limits; [Review #965](https://solveathome.org/projects/md5/review/965), C2/C4 scope corrections. The demonstrated families reconstruct unconstrained words from internal states; Q9 changes m8/m9/m12. In the issued 32-literal-lowercase-ASCII-hex domain those words lie in fixed padding, and the source does not impose the eight data words' ASCII constraints or the input-dependent prefix predicate. Its 52-byte length-word experiments are not this 32-byte domain. The issued self-match state summary also identifies Q9's m8/m9/m12 padding mismatch. Thus neither the captured rates nor a demonstrated legal family transfers directly; no self-match method or fixed-point conclusion is supplied.\n\nInapplicable means direct use of the demonstrated family and evidence in the exact issued domain. It does not exclude every adapted carry-free construction or deny that a conditional MD5 state identity remains mathematically meaningful. A proposed adaptation would need the exact ASCII32 constraints, RFC IV, all 64 steps, feedforward, complete padding and candidate-dependent digest-prefix comparison. The unscoped source cannot be transferred automatically; scope_keys is intentionally empty.\n\n### all-zeros: applicable\n\nProvisional relevance for restricted method screening, not validated legal-message performance. [Return #2993](https://solveathome.org/projects/md5/return/2993), C1-C3, directly studies whether carry-free bit families can share more computation than Q9 in an absolute leading-zero search. [Review #965](https://solveathome.org/projects/md5/review/965) retains the conditional m0-fixed barrier 2D=0, the implemented target-25 zero-hit enumerations (1,014 r=1 leaves and 808,378 r=2 leaves), and the represented MSB common-base subspace result max_dim=1. These bear on the all-zeros method question. Review #1183 confirms the restricted CPU search captures. Review #965 corrects C4: seven patterns total 30,064,312,320 draws, checks stop at zero-based step 60, and the legality flag checks m14/m15 but omits complete 52-byte padding. Its seed 0x6277 Q9 counterexample has m13=0xd59ea902 rather than 0x00000080. These are compression-state observations, not complete legal <=1024-byte MD5 output evidence.\n\nPreserve one fixed chaining value and fixed final length words, the implementation's coefficientwise disjoint carry-free units (r<=2), per-unit bit conditions and its rejection of varying rotated terms as NL. The nonzero-low-bit Q16 barrier assumes shared preceding sums, identical carry-free realizations and fixed m0; D=0 families changing only Q13..Q15 are addressed only by their restricted enumerations. The MSB width result is for represented common-base GF(2) subspaces. Carry propagation, linked rotated units, mixed low/MSB units, r>=3, varying chaining values and multiblock constructions remain outside the search. The 7/2398 (~0.291910%) add-on expression is an unimplemented conditional suffix-cost projection assuming 2^-6 availability and no overhead, not a measured gain or universal upper bound. Absolute zero-target yield, legal full padding, distinct outputs and complete setup/member-generation/verification costs are not established. No typed accepted scope exists, so this applicable relevance stays provisional and cannot transfer automatically.\n\n### smallest-collision: unresolved\n\n[Return #2993](https://solveathome.org/projects/md5/return/2993), Model T/C1-C3 and Sources, provides a possible tool bridge: bit conditions and shared inner sums can screen candidate tunnel constructions. It was motivated by Stevens' Q14 tunnel, but the cited mechanism changes m14 whereas this source fixes final length words. [Review #965](https://solveathome.org/projects/md5/review/965) restricts completeness to the implemented model and identifies incomplete message padding and prefix-only execution. Sharing early inner sums among members neither supplies a collision differential through all 64 updates nor proves equality of the four feedforward output words. No distinct legal full-digest pair, shorter total byte count, matched collision-generator cost, or collision-path-compatible source family is established. The current collision state summary separates stock-condition/path exclusions and earlier low-yield observations from general shorter-collision impossibility. Hence a useful compatible bridge is possible but unestablished.\n\nAny use must retain the exact source model and separately establish compatibility with a specified collision path, both members' reachable standard-IV states, full padding and encoded lengths, distinct bytes and all 128 final digest bits. Equal or unequal lengths are legal in the target, but this source's fixed-length/fixed-CV model cannot be treated as covering all of them. Neither the target-25 empty syntactic search nor width-2 represented MSB result excludes arbitrary shortest-collision constructions. Missing legal/path evidence and missing typed scope authority remain unresolved conditions; this row authorizes no experiment and no automatic transfer.\n\n## Dependencies, negative scope and remaining conditions\n\nThe source credits #2676's word-family search and Q9/Q4 controls, earlier Q9 work and Klima/Stevens mechanisms. Those are retained as the source's dependencies and attribution, not re-inspected primary evidence or newly endorsed claims here. Reviews #965/#1183 must accompany the report: the accepted syntactic searches do not close all generators, all-zero methods or shortest-collision paths. Review #965's explicit padding counterexample is not erased by #1183's reproduction of compression rates. Captured probabilities are finite PRNG observations; the eight-success row is particularly uncertain. No matched absolute-target yield or end-to-end performance gain follows.\n\nReconsider a row only with material source/scope authority changes or a specified legal-domain/path bridge addressing its missing conditions. These are recorded gaps, not follow-up assignments. No experiment, proof rerun, candidate search, review request, route change or OUTCOMES integration occurred. Scientific compute launches: 0; scientific CPU seconds: 0; cpu_hours: 0. Source access, parsing and writing overhead is not scientific CPU measurement.\n\n## Sources actually used\n\n- [Return #2993](https://solveathome.org/projects/md5/return/2993), Model T, C1-C4, Limits, recipe, artifact references, resolved file note and current research authority; report hash above.\n- [Review #965](https://solveathome.org/projects/md5/review/965), C1-C4 restrictions, padding counterexample, finite counts and conditional cost projection; complete notes read in the return response. [Review #1183](https://solveathome.org/projects/md5/review/1183), search reproduction, model restrictions, timing-field repair and independent compression observations; complete notes read in the same response.\n- [Job #7297](https://solveathome.org/projects/md5/job/7297), issued task, exact targets and current state summaries. The self-match summary's Dead ends/Tricks and current collision summary's Dead ends/Tricks were used for domain mismatch and path restrictions, without surveying their cited records anew.\n- Latest local shared summaries: all-zeros v8 (summaries/all-zeros.json), self-match v10 (summaries/self-match.json), collision-padding v8 (summaries/collision-padding.json), scoped relevant passages only; local-only evidence, older background and no present-acceptance inference. Their SHA-256 values are respectively 2d76a049c75cf1083195ebb4357bbbdf9a4f6dd0332657ca7a0a8c070c1ac008, bbb7046cf3bd7f555b4d2e406d1539960f3e74636c56ef09ae8644ecec25552a, d050f71a642e601dd294f00c0bb0e6879b9076bbf07c6c19ad1850015a4e3993.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded result, with the source-filter attempt limitation noted above. Cached department protocol evidence/publication/files sections governed evidence and publication format.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T10:55:26.277Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2993],"messages":[]},"tokens":{"log":"summary","input":137885,"models":{"gpt-6.1-sol":9878},"output":9878,"source":"reported","entries":0,"cache_read":917248,"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-14T10:55:32.047Z","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_f583e425edeb5640b88d9c19","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"[Return #2993](https://solveathome.org/projects/md5/return/2993), Model T, controls, C1-C4 and Limits; [Review #965](https://solveathome.org/projects/md5/review/965), C2/C4 scope corrections. The demonstrated families reconstruct unconstrained words from internal states; Q9 changes m8/m9/m12. In the issued 32-literal-lowercase-ASCII-hex domain those words lie in fixed padding, and the source does not impose the eight data words' ASCII constraints or the input-dependent prefix predicate. Its 52-byte length-word experiments are not this 32-byte domain. The issued self-match state summary also identifies Q9's m8/m9/m12 padding mismatch. Thus neither the captured rates nor a demonstrated legal family transfers directly; no self-match method or fixed-point conclusion is supplied.","assumptions_md":"Inapplicable means direct use of the demonstrated family and evidence in the exact issued domain. It does not exclude every adapted carry-free construction or deny that a conditional MD5 state identity remains mathematically meaningful. A proposed adaptation would need the exact ASCII32 constraints, RFC IV, all 64 steps, feedforward, complete padding and candidate-dependent digest-prefix comparison. The unscoped source cannot be transferred automatically; scope_keys is intentionally empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance for restricted method screening, not validated legal-message performance. [Return #2993](https://solveathome.org/projects/md5/return/2993), C1-C3, directly studies whether carry-free bit families can share more computation than Q9 in an absolute leading-zero search. [Review #965](https://solveathome.org/projects/md5/review/965) retains the conditional m0-fixed barrier 2D=0, the implemented target-25 zero-hit enumerations (1,014 r=1 leaves and 808,378 r=2 leaves), and the represented MSB common-base subspace result max_dim=1. These bear on the all-zeros method question. Review #1183 confirms the restricted CPU search captures. Review #965 corrects C4: seven patterns total 30,064,312,320 draws, checks stop at zero-based step 60, and the legality flag checks m14/m15 but omits complete 52-byte padding. Its seed 0x6277 Q9 counterexample has m13=0xd59ea902 rather than 0x00000080. These are compression-state observations, not complete legal <=1024-byte MD5 output evidence.","assumptions_md":"Preserve one fixed chaining value and fixed final length words, the implementation's coefficientwise disjoint carry-free units (r<=2), per-unit bit conditions and its rejection of varying rotated terms as NL. The nonzero-low-bit Q16 barrier assumes shared preceding sums, identical carry-free realizations and fixed m0; D=0 families changing only Q13..Q15 are addressed only by their restricted enumerations. The MSB width result is for represented common-base GF(2) subspaces. Carry propagation, linked rotated units, mixed low/MSB units, r>=3, varying chaining values and multiblock constructions remain outside the search. The 7/2398 (~0.291910%) add-on expression is an unimplemented conditional suffix-cost projection assuming 2^-6 availability and no overhead, not a measured gain or universal upper bound. Absolute zero-target yield, legal full padding, distinct outputs and complete setup/member-generation/verification costs are not established. No typed accepted scope exists, so this applicable relevance stays provisional and cannot transfer automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #2993](https://solveathome.org/projects/md5/return/2993), Model T/C1-C3 and Sources, provides a possible tool bridge: bit conditions and shared inner sums can screen candidate tunnel constructions. It was motivated by Stevens' Q14 tunnel, but the cited mechanism changes m14 whereas this source fixes final length words. [Review #965](https://solveathome.org/projects/md5/review/965) restricts completeness to the implemented model and identifies incomplete message padding and prefix-only execution. Sharing early inner sums among members neither supplies a collision differential through all 64 updates nor proves equality of the four feedforward output words. No distinct legal full-digest pair, shorter total byte count, matched collision-generator cost, or collision-path-compatible source family is established. The current collision state summary separates stock-condition/path exclusions and earlier low-yield observations from general shorter-collision impossibility. Hence a useful compatible bridge is possible but unestablished.","assumptions_md":"Any use must retain the exact source model and separately establish compatibility with a specified collision path, both members' reachable standard-IV states, full padding and encoded lengths, distinct bytes and all 128 final digest bits. Equal or unequal lengths are legal in the target, but this source's fixed-length/fixed-CV model cannot be treated as covering all of them. Neither the target-25 empty syntactic search nor width-2 represented MSB result excludes arbitrary shortest-collision constructions. Missing legal/path evidence and missing typed scope authority remain unresolved conditions; this row authorizes no experiment and no automatic transfer.","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":7297,"input_sha256":"bb7fe6acce7a5ca2c4c363de1b40112448f736f461caac0687c348d4a8e25fd8","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"b15fed9ee5a7eaac717b5370706196d6996f17974f3014982c9b9c3b14032c8a","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2993,"material_evidence":{"sha256":"102fc621912f71806af068cc844fcac51c6afa05b6a2cc17ce3355cc62f51b55","entries":{"return:2993":"93cebb7515c6ef99d615b8d69f1d35ea9a6978a8c7e58a8df25240d7d569d33f","artifact:2993:048bac387e6ffae17a5c1868c5a2fa1d369537ad9eb17f23b03c220aae0768b3":"048bac387e6ffae17a5c1868c5a2fa1d369537ad9eb17f23b03c220aae0768b3","artifact:2993:11a1da39bcab8b06e2a6fbc79f34c4cdcb40512fb41ecd2b3859325836a1e721":"11a1da39bcab8b06e2a6fbc79f34c4cdcb40512fb41ecd2b3859325836a1e721","artifact:2993:2d431022addf5fc463178bfeeb72b6d4cc76cb9a62cfbaba3d2759d66a74f33a":"2d431022addf5fc463178bfeeb72b6d4cc76cb9a62cfbaba3d2759d66a74f33a","artifact:2993:3c26275c6eb95e4d0e968aabc15bdb07b229ca52db0478548e0cbf0234bc838c":"3c26275c6eb95e4d0e968aabc15bdb07b229ca52db0478548e0cbf0234bc838c","artifact:2993:46b867998e906ca68681d63c5e74c01bd1c135b4ae8c9c715000757006b034ce":"46b867998e906ca68681d63c5e74c01bd1c135b4ae8c9c715000757006b034ce","artifact:2993:504de7a92bd6210204a8ae754f1807dd01a5aa94201fe6b8a841d18288c59cb7":"504de7a92bd6210204a8ae754f1807dd01a5aa94201fe6b8a841d18288c59cb7","artifact:2993:594cbb6fb33afd12bfe49a637260a407ac92632e027c1633fc7576900d7649ee":"594cbb6fb33afd12bfe49a637260a407ac92632e027c1633fc7576900d7649ee","artifact:2993:72b92e333a6c5681f493015115d1a5006c1f1d0b5180ac2d07ab33f001e33180":"72b92e333a6c5681f493015115d1a5006c1f1d0b5180ac2d07ab33f001e33180","artifact:2993:75e394326fd96b866ea948d45c08e5a504d573820586137410e1736b9465f9dd":"75e394326fd96b866ea948d45c08e5a504d573820586137410e1736b9465f9dd","artifact:2993:7bf391bfa6b4bbd8adb48f6986207266d0897c46381914448b9988e2558aa2c7":"7bf391bfa6b4bbd8adb48f6986207266d0897c46381914448b9988e2558aa2c7","artifact:2993:9b363a7bd122d4875d20711916153b2f42bc71a6d18d0ea5f2fbe007ae1f98a0":"9b363a7bd122d4875d20711916153b2f42bc71a6d18d0ea5f2fbe007ae1f98a0","artifact:2993:9c49c325aa8e4dba5c3aa27fb84b10e166057bbfa063008708cb185b5397e191":"9c49c325aa8e4dba5c3aa27fb84b10e166057bbfa063008708cb185b5397e191","artifact:2993:a4ba6b8ef42730c2cc72a5945752d2b0c549d35f44d7bc6aa0b72553171f4cd1":"a4ba6b8ef42730c2cc72a5945752d2b0c549d35f44d7bc6aa0b72553171f4cd1","artifact:2993:aa76dcf14369de0fb7fcb617141c486d1a3ee6033d36a4872715d9510594a9bb":"aa76dcf14369de0fb7fcb617141c486d1a3ee6033d36a4872715d9510594a9bb","artifact:2993:adf6d905cce82e393383cb0b9a57c586b44c4ce47cfba11c2d2260e472e0c758":"adf6d905cce82e393383cb0b9a57c586b44c4ce47cfba11c2d2260e472e0c758","artifact:2993:b51dc3f4890ddc245b5c4d9728d3bc812246a6054c2292254ce640a655635004":"b51dc3f4890ddc245b5c4d9728d3bc812246a6054c2292254ce640a655635004","artifact:2993:f773b371bd369520dba02a31d2d7b89255b079a85615d36281861ae46f46a257":"f773b371bd369520dba02a31d2d7b89255b079a85615d36281861ae46f46a257","artifact:2993:ff89b4473535be76f1582b5ffd92ec9aafd2bbf2c3c2f04c08875cce7d77f12b":"ff89b4473535be76f1582b5ffd92ec9aafd2bbf2c3c2f04c08875cce7d77f12b"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2993,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":"2026-10-14T10:55:26.277Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2993: 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\":2993,\"report_sha256\":\"b15fed9ee5a7eaac717b5370706196d6996f17974f3014982c9b9c3b14032c8a\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2993\":\"93cebb7515c6ef99d615b8d69f1d35ea9a6978a8c7e58a8df25240d7d569d33f\",\"artifact:2993:048bac387e6ffae17a5c1868c5a2fa1d369537ad9eb17f23b03c220aae0768b3\":\"048bac387e6ffae17a5c1868c5a2fa1d369537ad9eb17f23b03c220aae0768b3\",\"artifact:2993:11a1da39bcab8b06e2a6fbc79f34c4cdcb40512fb41ecd2b3859325836a1e721\":\"11a1da39bcab8b06e2a6fbc79f34c4cdcb40512fb41ecd2b3859325836a1e721\",\"artifact:2993:2d431022addf5fc463178bfeeb72b6d4cc76cb9a62cfbaba3d2759d66a74f33a\":\"2d431022addf5fc463178bfeeb72b6d4cc76cb9a62cfbaba3d2759d66a74f33a\",\"artifact:2993:3c26275c6eb95e4d0e968aabc15bdb07b229ca52db0478548e0cbf0234bc838c\":\"3c26275c6eb95e4d0e968aabc15bdb07b229ca52db0478548e0cbf0234bc838c\",\"artifact:2993:46b867998e906ca68681d63c5e74c01bd1c135b4ae8c9c715000757006b034ce\":\"46b867998e906ca68681d63c5e74c01bd1c135b4ae8c9c715000757006b034ce\",\"artifact:2993:504de7a92bd6210204a8ae754f1807dd01a5aa94201fe6b8a841d18288c59cb7\":\"504de7a92bd6210204a8ae754f1807dd01a5aa94201fe6b8a841d18288c59cb7\",\"artifact:2993:594cbb6fb33afd12bfe49a637260a407ac92632e027c1633fc7576900d7649ee\":\"594cbb6fb33afd12bfe49a637260a407ac92632e027c1633fc7576900d7649ee\",\"artifact:2993:72b92e333a6c5681f493015115d1a5006c1f1d0b5180ac2d07ab33f001e33180\":\"72b92e333a6c5681f493015115d1a5006c1f1d0b5180ac2d07ab33f001e33180\",\"artifact:2993:75e394326fd96b866ea948d45c08e5a504d573820586137410e1736b9465f9dd\":\"75e394326fd96b866ea948d45c08e5a504d573820586137410e1736b9465f9dd\",\"artifact:2993:7bf391bfa6b4bbd8adb48f6986207266d0897c46381914448b9988e2558aa2c7\":\"7bf391bfa6b4bbd8adb48f6986207266d0897c46381914448b9988e2558aa2c7\",\"artifact:2993:9b363a7bd122d4875d20711916153b2f42bc71a6d18d0ea5f2fbe007ae1f98a0\":\"9b363a7bd122d4875d20711916153b2f42bc71a6d18d0ea5f2fbe007ae1f98a0\",\"artifact:2993:9c49c325aa8e4dba5c3aa27fb84b10e166057bbfa063008708cb185b5397e191\":\"9c49c325aa8e4dba5c3aa27fb84b10e166057bbfa063008708cb185b5397e191\",\"artifact:2993:a4ba6b8ef42730c2cc72a5945752d2b0c549d35f44d7bc6aa0b72553171f4cd1\":\"a4ba6b8ef42730c2cc72a5945752d2b0c549d35f44d7bc6aa0b72553171f4cd1\",\"artifact:2993:aa76dcf14369de0fb7fcb617141c486d1a3ee6033d36a4872715d9510594a9bb\":\"aa76dcf14369de0fb7fcb617141c486d1a3ee6033d36a4872715d9510594a9bb\",\"artifact:2993:adf6d905cce82e393383cb0b9a57c586b44c4ce47cfba11c2d2260e472e0c758\":\"adf6d905cce82e393383cb0b9a57c586b44c4ce47cfba11c2d2260e472e0c758\",\"artifact:2993:b51dc3f4890ddc245b5c4d9728d3bc812246a6054c2292254ce640a655635004\":\"b51dc3f4890ddc245b5c4d9728d3bc812246a6054c2292254ce640a655635004\",\"artifact:2993:f773b371bd369520dba02a31d2d7b89255b079a85615d36281861ae46f46a257\":\"f773b371bd369520dba02a31d2d7b89255b079a85615d36281861ae46f46a257\",\"artifact:2993:ff89b4473535be76f1582b5ffd92ec9aafd2bbf2c3c2f04c08875cce7d77f12b\":\"ff89b4473535be76f1582b5ffd92ec9aafd2bbf2c3c2f04c08875cce7d77f12b\"},\"sha256\":\"102fc621912f71806af068cc844fcac51c6afa05b6a2cc17ce3355cc62f51b55\"},\"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:2993,input_sha256:\"bb7fe6acce7a5ca2c4c363de1b40112448f736f461caac0687c348d4a8e25fd8\",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/3672/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"e0e32fd561e89e121ed75261d541d57a54cde21ab0df2cc8bd59fbb41cd37062","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}