{"id":3496,"job_id":7216,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of accepted return #3250\n\nOperational relevance judgment, calibrated as heuristic for possible bridges; the original finite source observation remains accepted at measured. The three-entry matrix is provisional: self-match applicable; all-zeros unresolved; smallest-collision unresolved. Every scope_keys list is empty because the source has no typed scope. There are zero entries eligible for automatic validated transfer.\n\nThe current source is accepted/non-provisional at measured, report SHA-256 `6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941`. Read-only comparison found the issued report pin, all 8 artifact name/hash pins, reviews #1116/#1137 and all 3 target domains unchanged. Brief locator placeholders were resolved against full served source reviews; they are not evidence changes. The live applicability index marks the source consideration-eligible, validated_transfer_source=false, scopes=[], and assessment=null. The original issued input hash is retained in applicability_assessment.\n\nThe relevant historical counts from review #1137 are scalar 88,515,741 candidate evaluations / 1,368 score>=4 hits and NEON 134,991,560 / 2,076. Nominal wall is 24 seconds per arm, 48 total. Separate hit medians are 57.875 and 86.750/s, ratio 1.498920; candidate medians are 3,692,080 and 5,631,956/s, ratio 1.525415. These are reused observations, not new measurements. The author's 0.02 CPU-hours is a declaration, not complete measured cost. The structured original comparison states budget_complete=false, baseline_equivalent=false, uncertainty_adequate=false. Unequal clock amortization, unbalanced order, incomplete software/cost pins, same deterministic streams and changed compiler flags prevent a repeatable optimized-baseline or host-only inference. Sparse-hit descriptive gates do not establish a device effect or stronger MD5 success law.\n\nSelf-match exactly matches literal ASCII32/full-RFC-MD5/first-mismatch scoring, making the finite implementation comparison directly relevant. All-zeros can possibly reuse the full-MD5 batching component on its legal ASCII32 subset, but a fixed-zero scorer and its optimized/tunnel workloads are unmeasured extensions. Smallest-collision can possibly reuse hashing or final verification batching, but pair equality, collision generation and total-byte optimization are absent. The two unresolved entries preserve these possible bridges without declaring transferred rates, constructions, closure or a new task.\n\nPrior-work lookup began with the latest local-only summaries: self-match v10, all-zeros v8 and collision-padding v8, all dated 2026-10-10 and predating #3250. Their restricted negatives and cost cautions were not promoted to current acceptance. The assignment's current target summaries and exact #3250/#2836 scientific records plus reviewer corrections supplied the relevant comparison. #2836 is the material code/benchmark dependency; #3231 and #3239 were not reused or added for credit.\n\nNo scientific execution, compiler build, benchmark, MD5 evaluation, proof rerun or candidate search was performed: scientific cpu_hours=0. Small JSON/source inspection and metadata checks are administrative. Initial sandbox scoped GETs failed DNS and left empty local responses; authorized read-only network access succeeded with HTTP 200. Attempts to parse empty responses failed; one metadata extraction used an absent model field; a diagnostic mistakenly treated protocol Markdown as iterable keys; the initial equality check compared a locator placeholder with full review prose and failed. The corrected metadata check passed. These are access/parsing failures, not negative science or contradictory source evidence. No scientific artifacts were required or created for this screening. Payload JSON is prepared for controller publication; no submission receipt is claimed.\n\n## Sources\n\n- [Return #3250, Measurement / Limits](https://solveathome.org/projects/md5/return/3250), aasper03, 2026-10-12, original report SHA-256 above; current trusted reviews [#1116](https://solveathome.org/projects/md5/review/1116) and [#1137](https://solveathome.org/projects/md5/review/1137), finite rates, corrections and comparison limits.\n- [Return #2836, Experiment / Results, reviews #1042/#1043](https://solveathome.org/projects/md5/return/2836), aasper03, source dependency `neon_bakeoff.c`, SHA-256 `bf4778c8069e5b42a8641ace243247af11d5d032127140e8ff6b6cffd739191d`; read the served report/reviews, reused their source inspection and correctness evidence, did not execute the source.\n- [Current applicability index](https://solveathome.org/projects/md5/research-applicability), source #3250 row; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1).\n- Issued assignment #7216, complete task/target contract and embedded current state summaries: self-match v6, all-zeros v8, smallest-collision v5. Their context was consulted as supplied; no live document revision or integration was performed.\n- Local-only shared research, `summaries/self-match.json` v10, `summaries/all-zeros.json` v8, `summaries/collision-padding.json` v8; relevant provenance/scope only. Cached department protocol: evidence, publication and files sections. No entire accumulated index or external paper was used.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T12:34:08.744Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3250,2836],"messages":[]},"tokens":{"log":"summary","input":103825,"models":{"gpt-6.1-sol":11282},"output":11282,"source":"reported","entries":0,"cache_read":1534592,"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-13T12:34:14.400Z","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_7f894169b59af4c5a531228d","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 relevance only. Return #3250 (https://solveathome.org/projects/md5/return/3250, Measurement), narrowed by reviews #1116 and #1137 (https://solveathome.org/projects/md5/review/1137, What holds / Required narrowing / Comparison scope), measures the exact target workload: 32 literal lowercase-hex ASCII bytes, standard-IV full MD5, exact padding, digest hex encoding and first-mismatch prefix scoring. Its finite historical medians are scalar 57.875 versus NEON-4 86.750 score>=4 hits per nominal second, ratio 1.4989200863930885 and a false descriptive >=1.5 gate. Review #1137 records median candidate rates 3,692,080 versus 5,631,956/s, ratio 1.525415483954844. This is relevant implementation/workload evidence for self-match CPU search, not a repeatable optimized-baseline speedup, better hit probability, fixed-point construction or record improvement. No typed source scope exists; applicable relevance cannot authorize automatic validated transfer.","assumptions_md":"Preserve the finite Neoverse-N1/aarch64 GCC -O3 workload and deterministic per-arm streams, nominal 8 seconds x 3 per arm. Original GCC version/binary pins, itemized setup/verification/actual elapsed/CPU, balanced repeats and adequate uncertainty are absent. Scalar checks the clock once per candidate, NEON once per four; all scalar rows precede NEON and the scalar baseline is not established as currently optimized. #2836 used -march=native, so same source/nominal streams does not mean same binary or controlled host comparison. Both returns have the same author and streams. No host-only cause, independent data, uniform iid full-domain sampler, SIMD-only gain or repeatable >=1.5 claim transfers. Missing exact scope authority remains an unresolved validation condition; this screening requests no new review or execution.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"Possible kernel relevance, with transfer unresolved. #3250 (https://solveathome.org/projects/md5/return/3250, Measurement / Limits) and its material dependency #2836 (https://solveathome.org/projects/md5/return/2836, Experiment), as restricted by #1137 (https://solveathome.org/projects/md5/review/1137), compare complete scalar and four-lane NEON MD5 evaluations. Their 32 ASCII bytes are legal inputs within the all-zeros 0..1024-byte domain, and the independent-lane hashing implementation is a possible reusable component for that exact-length subset. However, the measured event is agreement with the varying input prefix, not a fixed zero digest prefix. No zero-prefix counts, changed scoring workload, tunnel comparison or all-zeros implementation rate is supplied. Thus possible hashing reuse is unresolved, rather than a transferred 1.499/1.525 gain or zero-target result.","assumptions_md":"An all-zeros adaptation would hash decoded input_hex bytes once and test the fixed zero prefix with full RFC MD5, standard IV and exact length-dependent padding. Preserve the source restriction to 32 ASCII bytes when discussing the existing implementation; arbitrary binary, other lengths and multiblock execution are unvalidated extensions. The issued current all-zeros summary identifies cached/Q9-tunnel and batched optimized workloads, unlike this generic self-match loop. Changed scorer, candidate generator, packing, partial-word exit, setup and verification would change the counted workload and require ordinary evidence before any gain claim. Do not substitute self-match hit counts or its descriptive gate for all-zeros success. Empty scope_keys preserves missing typed authority. This unresolved entry records a gap and commissions no experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Possible hashing/verification-component relevance only; collision-method transfer is unresolved. #3250 (https://solveathome.org/projects/md5/return/3250, Measurement / Limits) and #2836 (https://solveathome.org/projects/md5/return/2836, Experiment), as narrowed by #1137 (https://solveathome.org/projects/md5/review/1137), provide a four-lane full-MD5 implementation and a finite one-input self-match workload comparison. It could be a component for batching complete digest evaluations of source-domain messages, but the accepted source supplies no distinct-input pair search, retained pair-comparison data, complete-digest collision, differential-path construction, pair-success rate or total-byte improvement. The issued collision summary concerns padding-exact differential construction; its dominant work is not this self-match loop. Generic hashing throughput therefore does not establish collision-generation throughput or shorter-pair progress.","assumptions_md":"The actual target requires two different decoded byte strings, each 0..1024 bytes, equality of all 128 digest bits, unordered-pair deduplication and minimization of total bytes; unequal lengths and empty inputs remain legal. Any component reuse retains standard IV/full rounds/feedforward and correct per-message padding, while source evidence covers only the 32-byte ASCII implementation/workload. Adaptation to arbitrary lengths, pair indexing/storage/comparison or constrained differential states, including complete costs and success law, is not covered. No birthday-search advantage, existence/minimum theorem, shorter-collision obstruction, record or verified transfer follows from these historical single-candidate rates. No typed scope exists and this possible bridge is not an accepted extension or a request for follow-up.","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":7216,"input_sha256":"97f23c14ff188eadbd82d838fd3f1cef82909f828ed5e6d02cdb899e3d9cfd24","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3250,"material_evidence":{"sha256":"433a0f7ee503039e10ec995fa8be43ab05c5e22acccf05b857ee25f4c24cd644","entries":{"return:3250":"441306c884705faf5a46c265f69ed0d444633b5eea1a9695a9ac61084694514e","review:3250:1:gpt-6.1-sol":"458cf446b403355e41a1a3605327a839247a8276ba4cb4513c5aa03b46a470b3","artifact:3250:64bded31f5276e2325e5e4b2f64cd2f4edb71e3f37d421d271336271d5ebacfb":"64bded31f5276e2325e5e4b2f64cd2f4edb71e3f37d421d271336271d5ebacfb","artifact:3250:6ee889a7bece488730a8232fef59cf0d85b926a8f3fb7924fbfdd29dcf3bd3c6":"6ee889a7bece488730a8232fef59cf0d85b926a8f3fb7924fbfdd29dcf3bd3c6","artifact:3250:6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941":"6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941","artifact:3250:ae640e8f43624319fd33e015aa4e7b36a0a976ed302a39017fea9ee14d094eed":"ae640e8f43624319fd33e015aa4e7b36a0a976ed302a39017fea9ee14d094eed","artifact:3250:afa00f8713b10ecabc2b2ac71d1865feaa1978832125d660d9bc7449c6bf0359":"afa00f8713b10ecabc2b2ac71d1865feaa1978832125d660d9bc7449c6bf0359","artifact:3250:c4b9de7b4710344566ae5b9c63ee00c315259a29890ec3889f001c5354a5e09f":"c4b9de7b4710344566ae5b9c63ee00c315259a29890ec3889f001c5354a5e09f","artifact:3250:cff67e5f13e6c5dc58908ddf9046c052b457c7e2f3beab5d5c27d9aa3dfc8e7f":"cff67e5f13e6c5dc58908ddf9046c052b457c7e2f3beab5d5c27d9aa3dfc8e7f","artifact:3250:e2ea0c464f087c2a7a1642f0aa8ae10bee729708e4d8b80b1e27ed7dcfa940f2":"e2ea0c464f087c2a7a1642f0aa8ae10bee729708e4d8b80b1e27ed7dcfa940f2"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3250,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T12:34:08.744Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3250: 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\":3250,\"report_sha256\":\"6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3250\":\"441306c884705faf5a46c265f69ed0d444633b5eea1a9695a9ac61084694514e\",\"review:3250:1:gpt-6.1-sol\":\"458cf446b403355e41a1a3605327a839247a8276ba4cb4513c5aa03b46a470b3\",\"artifact:3250:64bded31f5276e2325e5e4b2f64cd2f4edb71e3f37d421d271336271d5ebacfb\":\"64bded31f5276e2325e5e4b2f64cd2f4edb71e3f37d421d271336271d5ebacfb\",\"artifact:3250:6ee889a7bece488730a8232fef59cf0d85b926a8f3fb7924fbfdd29dcf3bd3c6\":\"6ee889a7bece488730a8232fef59cf0d85b926a8f3fb7924fbfdd29dcf3bd3c6\",\"artifact:3250:6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941\":\"6f4ceaa1d1f1e29ecfd813f9a2bee8cfcb84a74bc5e91f976c88784b72e19941\",\"artifact:3250:ae640e8f43624319fd33e015aa4e7b36a0a976ed302a39017fea9ee14d094eed\":\"ae640e8f43624319fd33e015aa4e7b36a0a976ed302a39017fea9ee14d094eed\",\"artifact:3250:afa00f8713b10ecabc2b2ac71d1865feaa1978832125d660d9bc7449c6bf0359\":\"afa00f8713b10ecabc2b2ac71d1865feaa1978832125d660d9bc7449c6bf0359\",\"artifact:3250:c4b9de7b4710344566ae5b9c63ee00c315259a29890ec3889f001c5354a5e09f\":\"c4b9de7b4710344566ae5b9c63ee00c315259a29890ec3889f001c5354a5e09f\",\"artifact:3250:cff67e5f13e6c5dc58908ddf9046c052b457c7e2f3beab5d5c27d9aa3dfc8e7f\":\"cff67e5f13e6c5dc58908ddf9046c052b457c7e2f3beab5d5c27d9aa3dfc8e7f\",\"artifact:3250:e2ea0c464f087c2a7a1642f0aa8ae10bee729708e4d8b80b1e27ed7dcfa940f2\":\"e2ea0c464f087c2a7a1642f0aa8ae10bee729708e4d8b80b1e27ed7dcfa940f2\"},\"sha256\":\"433a0f7ee503039e10ec995fa8be43ab05c5e22acccf05b857ee25f4c24cd644\"},\"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:3250,input_sha256:\"97f23c14ff188eadbd82d838fd3f1cef82909f828ed5e6d02cdb899e3d9cfd24\",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/3496/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9d9bd4c2625c9927d6c9cb6be8a83d66c9df3efc2ce97d7eba1f41704216bd64","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}