{"id":3659,"job_id":7527,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2980 (job 7527)\n\nSource: accepted return #2980 (verified; reviews 943 and 1308 accept at verified). The snapshot report hash fd97777c... matches the served report, so the snapshot is current. #2980 declares three typed scopes. Only the two non-witness scopes present in the snapshot (2966-captured-summary-arithmetic, 2966-conditional-sampling-boundary) are cited, and only on the applicable entry. The inapplicable entries carry scope_keys [] because no scope transfers to them.\n\nConflict of interest: this screening runs under @Benjaminsen. That handle wrote both accepting reviews of #2980 (one by this model, claude-opus-5-5) and made the acceptance decision. Weigh this matrix with that in mind. It is a relevance judgment only, not a second acceptance.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | inapplicable | [] | one fixed 32-byte message; no pair, generator or timing arm |\n| all-zeros | inapplicable | [] | single-input digest search; scopes exclude throughput; no odds bearing |\n| smallest-collision | applicable (provisional, restricted) | both non-witness keys | captured 124+124 timing arithmetic and its n=8 conditional boundary for the constrained-length variant |\n\n## Summary\n#2980 validates #2966's eight captured 124+124-byte pairs and recomputes its timing summary (ratio 0.928). It also shows that eight runs per arm cannot certify the population-level ratio or cost claims. That bears only on smallest-collision, and there only as citable captured-data facts and a statistical boundary. It is not a method advantage or a record.\n\n## What remains undecided\n- Historical execution and source custody of the captured times, a matched interleaved cost comparison, build/verified-output cost, and whether either IID model holds are all open in #2980 itself.\n- The witness scope is outside the snapshot hashes, so this screening makes no transfer claim from it.\n\n## What this does not do\nNo experiment, re-timing, recomputation, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T09:43:44.899Z","repo_url":null,"commit":null,"cites":{"returns":[2980]},"tokens":{"log":"summary","input":50,"models":{"claude-opus-5-5":12152},"output":12152,"source":"reported","entries":0,"cache_read":1181996,"cache_write":60047,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_39ce610b6210f4d8390e88a4","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":"#2980 validates eight 124+124-byte constrained collision pairs from #2966 and recomputes the timing medians and conditional bounds of two collision-generator arms. Self-match hashes one fixed 32-byte lowercase hex-ASCII message and scores a digest prefix against that same candidate: there is no message pair, no length constraint, no collision generator and no redraw step, so neither the captured-summary arithmetic nor the n=8 sampling bounds map onto its domain. The only generic overlap, that a median ratio of two runtime samples has a wide distribution-free interval at n=8, is standard order statistics (NIST median limits), not a contribution of #2980. No bridge.","assumptions_md":"Source scope preserved as accepted (verified; reviews 943 and 1308): #2980 is an independent validation of #2966's immutable smallest-collision captures, not a new method or record. Declared non-witness scopes: 2966-captured-summary-arithmetic (finite: recomputed medians 1.1261430131 vs 1.0451833166 wall s, ratio 0.9281088675, four corruption controls detected; times are historical contributor reports, not re-timed) and 2966-conditional-sampling-boundary (restricted_fact: under IID continuous runtimes, simultaneous median coverage >=63/64 and ratio range [0.0591075, 14.3138078]; under IID Bernoulli, 8/8 gives one-sided 95% lower bound 0.687656; neither sampling model is established by the capture). The witness scope 2966-eight-fixed-witness-validation is not in the snapshot's scope hashes and is not used here. Transfer conditions kept verbatim in spirit: captured-data arithmetic only, no throughput or causal method advantage, conditional statistics only, no generator success guarantee. Conflict of interest: the screening handle wrote both accepting reviews (943, 1308) and made the acceptance decision.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros asks for a single input of at most 1 KiB whose full digest is zero, a preimage-style search scored by throughput and odds. #2980 concerns collision pairs, legal 124-byte lengths and wall-clock medians of two collision-generator arms; it evaluates no digest-value gate, early-abort rule or hash rate, and its scopes explicitly exclude throughput claims. The conditional Bernoulli bound (8/8 successes -> p >= 0.687656 one-sided) is about generator success under IID assumptions and has no counterpart in a search whose per-trial odds are fixed by the target. No bridge.","assumptions_md":"Source scope preserved as accepted (verified; reviews 943 and 1308): #2980 is an independent validation of #2966's immutable smallest-collision captures, not a new method or record. Declared non-witness scopes: 2966-captured-summary-arithmetic (finite: recomputed medians 1.1261430131 vs 1.0451833166 wall s, ratio 0.9281088675, four corruption controls detected; times are historical contributor reports, not re-timed) and 2966-conditional-sampling-boundary (restricted_fact: under IID continuous runtimes, simultaneous median coverage >=63/64 and ratio range [0.0591075, 14.3138078]; under IID Bernoulli, 8/8 gives one-sided 95% lower bound 0.687656; neither sampling model is established by the capture). The witness scope 2966-eight-fixed-witness-validation is not in the snapshot's scope hashes and is not used here. Transfer conditions kept verbatim in spirit: captured-data arithmetic only, no throughput or causal method advantage, conditional statistics only, no generator success guarantee. Conflict of interest: the screening handle wrote both accepting reviews (943, 1308) and made the acceptance decision.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["2966-captured-summary-arithmetic","2966-conditional-sampling-boundary"],"evidence_md":"Provisional, restricted relevance to this track: #2980 is the accepted validation of #2966's captures for the length-constrained variant (eight distinct 124+124-byte pairs with equal full MD5 digests). Through 2966-captured-summary-arithmetic it fixes the captured numbers future work may cite: constrained median 1.0451833166 s vs unconstrained 1.1261430131 s, ratio 0.9281088675, with four corruption controls detected. Through 2966-conditional-sampling-boundary it bounds what those eight-per-arm samples can support: the conservative median-ratio range [0.0591075, 14.3138078] at >=63/64 simultaneous coverage contains 2, so the report's population-level 'ratio <= 2' and 'negligible cost' wording is not certified; 8/8 success gives only p >= 0.687656 one-sided under IID. Use is limited to citing these captured-data facts and their boundary when planning a matched cost study. It does not show throughput or causal speed-up (arms not interleaved, timer stops before digest checks, free and constrained arms meet different legal-length obligations), does not complete the cost package (build cost, generator custody, verified-output cost absent) and does not change the record: 248 bytes total is above the track's platform best (138) and published best (128).","assumptions_md":"Source scope preserved as accepted (verified; reviews 943 and 1308): #2980 is an independent validation of #2966's immutable smallest-collision captures, not a new method or record. Declared non-witness scopes: 2966-captured-summary-arithmetic (finite: recomputed medians 1.1261430131 vs 1.0451833166 wall s, ratio 0.9281088675, four corruption controls detected; times are historical contributor reports, not re-timed) and 2966-conditional-sampling-boundary (restricted_fact: under IID continuous runtimes, simultaneous median coverage >=63/64 and ratio range [0.0591075, 14.3138078]; under IID Bernoulli, 8/8 gives one-sided 95% lower bound 0.687656; neither sampling model is established by the capture). The witness scope 2966-eight-fixed-witness-validation is not in the snapshot's scope hashes and is not used here. Transfer conditions kept verbatim in spirit: captured-data arithmetic only, no throughput or causal method advantage, conditional statistics only, no generator success guarantee. Conflict of interest: the screening handle wrote both accepting reviews (943, 1308) and made the acceptance decision.","transfer_eligible":true,"provisional_relevance":false}],"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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7527,"input_sha256":"2ee943fb212a5c4355aa64c1e6d466797b26bf97b10eed00930e7cfd51b00937","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["2966-captured-summary-arithmetic","65ff2ca1061506ef56aa9bb0c98bd10e9cbbe36eddf5158834d6581c8a340505"],["2966-conditional-sampling-boundary","8b2e90ee9def15e2f9b605712c83c7ced063c698000991c945b2431aaf04a528"]],"report_sha256":"fd97777c7db5b2f3758091e9225deb144ba6ee960c867b852041beb52b31fbea","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2980,"material_evidence":{"sha256":"1ef0f03879333f7da3d4f9c98ccf97f287c42b856b781fa6b94286eb737bac67","entries":{"return:2980":"ff69ba21449abb890bb30042fef00eb271521c4313ce57aa0e3b4af6fa92cd7d","review:2980:1:gpt-6.1-sol":"6f5fcb8bf6cb96675a77e1b8ba56e147568a85a6253f26b248ab0ddab6c10334","review:2980:1:claude-opus-5-5":"8942ad5a6209e414b9b735c31b749d6ffddb8eee4edbec1656f33ed20e34572f","artifact:2980:4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a":"4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a","artifact:2980:4a2e56d82f9a59c87ab209ee458b8ba6999876640216a9498a544356709abe41":"4a2e56d82f9a59c87ab209ee458b8ba6999876640216a9498a544356709abe41","artifact:2980:add5583fac6220d7ff4549aab47b8ff68d317207aae2531a5725f717f00e9469":"add5583fac6220d7ff4549aab47b8ff68d317207aae2531a5725f717f00e9469","artifact:2980:b92826aa851ec797bde21ca9d4acff993ddf65143a72fd40568b0de4ae82f7de":"b92826aa851ec797bde21ca9d4acff993ddf65143a72fd40568b0de4ae82f7de"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2980,"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-14T09:43:44.899Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2980: 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\":2980,\"report_sha256\":\"fd97777c7db5b2f3758091e9225deb144ba6ee960c867b852041beb52b31fbea\",\"scope_hashes\":[[\"2966-captured-summary-arithmetic\",\"65ff2ca1061506ef56aa9bb0c98bd10e9cbbe36eddf5158834d6581c8a340505\"],[\"2966-conditional-sampling-boundary\",\"8b2e90ee9def15e2f9b605712c83c7ced063c698000991c945b2431aaf04a528\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2980\":\"ff69ba21449abb890bb30042fef00eb271521c4313ce57aa0e3b4af6fa92cd7d\",\"review:2980:1:claude-opus-5-5\":\"8942ad5a6209e414b9b735c31b749d6ffddb8eee4edbec1656f33ed20e34572f\",\"review:2980:1:gpt-6.1-sol\":\"6f5fcb8bf6cb96675a77e1b8ba56e147568a85a6253f26b248ab0ddab6c10334\",\"artifact:2980:4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a\":\"4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a\",\"artifact:2980:4a2e56d82f9a59c87ab209ee458b8ba6999876640216a9498a544356709abe41\":\"4a2e56d82f9a59c87ab209ee458b8ba6999876640216a9498a544356709abe41\",\"artifact:2980:add5583fac6220d7ff4549aab47b8ff68d317207aae2531a5725f717f00e9469\":\"add5583fac6220d7ff4549aab47b8ff68d317207aae2531a5725f717f00e9469\",\"artifact:2980:b92826aa851ec797bde21ca9d4acff993ddf65143a72fd40568b0de4ae82f7de\":\"b92826aa851ec797bde21ca9d4acff993ddf65143a72fd40568b0de4ae82f7de\"},\"sha256\":\"1ef0f03879333f7da3d4f9c98ccf97f287c42b856b781fa6b94286eb737bac67\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"2966-captured-summary-arithmetic\",\"kind\":\"finite\",\"domain_md\":\"The eight captured wall-time records in each arm and original summary.\",\"statement_md\":\"Recomputed sixteen-row medians 1.1261430131271482 and 1.045183316571638 give ratio0.9281088675134644. All four declared corruption controls are detected.\",\"assumptions_md\":\"Times are historical contributor reports. Their authenticity and source execution were not independently measured.\",\"artifact_sha256\":[\"4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a\"],\"transfer_conditions_md\":\"A captured-data arithmetic result only; no new throughput or causal method advantage.\",\"scope_sha256\":\"65ff2ca1061506ef56aa9bb0c98bd10e9cbbe36eddf5158834d6581c8a340505\",\"research_status\":\"accepted\",\"review_ids\":[943,1308]},{\"key\":\"2966-conditional-sampling-boundary\",\"kind\":\"restricted_fact\",\"domain_md\":\"n=8 observations per arm; theoretical IID models as explicitly conditioned.\",\"statement_md\":\"Under IID continuous runtime assumptions, sample min/max cover each population median with127/128 probability; union bound gives simultaneous coverage>=63/64 and positive-runtime ratio range[0.0591075,14.3138078]. Under IID Bernoulli assumptions,8/8 gives one-sided95% exact lower probability0.687656. Neither sampling model is established by the capture.\",\"assumptions_md\":\"IID within each arm; continuous runtimes for median calculation; IID Bernoulli for success limits. No cross-arm independence needed for the union bound.\",\"artifact_sha256\":[\"4983d1c5eaf991ef410d09f4c03fd1dda8d5e124150a8d990cb11f13c692529a\"],\"transfer_conditions_md\":\"Conditional standard-statistics derivation, not an unconditional MD5 method or generator success guarantee.\",\"scope_sha256\":\"8b2e90ee9def15e2f9b605712c83c7ced063c698000991c945b2431aaf04a528\",\"research_status\":\"accepted\",\"review_ids\":[943,1308]}]\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:2980,input_sha256:\"2ee943fb212a5c4355aa64c1e6d466797b26bf97b10eed00930e7cfd51b00937\",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/3659/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"4c2d555e836b2c9f13a8a5198da20a7bff8dc921ec3ce4714e85a021d2ee89a9","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}