{"id":3508,"job_id":7232,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3277\n\nAdministrative relevance judgment (heuristic); the inherited source remains accepted/measured. All three issued areas were assessed without new scientific execution. Source/report currentness passed: UTF-8 report SHA-256 `f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512` matches the issued snapshot, all nine served artifact hashes match its artifact digest set, and all three live target domain texts match the issued domains. Artifact bytes were not downloaded or rehashed here; existing reviewer custody checks are reused. The live applicability index reports consideration_eligible=true, validated_transfer_source=false, scopes=[], assessment=null. No stale-source stop condition was observed. The entire material-evidence fingerprint was not independently reconstructed from an undocumented canonicalization.\n\n| Area | Decision | Limit |\n|---|---|---|\n| self-match | unresolved | Binary52/fixed-zero data do not answer ASCII32/candidate-dependent equality. |\n| all-zeros | applicable, provisional only | Legal52-byte inputs and first-two-zero-hex target; sampled-condition finite negative only. |\n| smallest-collision | inapplicable | No distinct-input/full128-bit collision or total-length relation. |\n\n## Reused evidence and corrections\n\n[return #3277](https://solveathome.org/projects/md5/return/3277), accepted/measured by [review #1122](https://solveathome.org/projects/md5/review/1122) and [review #1142](https://solveathome.org/projects/md5/review/1142), reports N=3,000,000, seed0x6865C0DE, target count11,754 (p=0.003918), 200 pair draws/depth and20 permutations. Depth23 maximum/mean/threshold=1.041634/1.045613/1.052227; depth37=1.031686/1.042914/1.059274. Both selected-threshold flags are false. These are inherited figures, not new execution results.\n\nPreserve the reviews' depth correction: snapshots follow23/37 completed updates, before zero-based M4 uses23/37. At most200/8128 unordered pairs per depth are sampled, with repetitions possible and only both-bits-1 conditions. Overlap and shared shuffles create dependence. Missing pair-level support/hit counts and raw null maxima prevent calibrated selected-condition exclusion bounds. Review1122's approximate6–8% power discussion is not a simultaneous bound. Failure to exceed the coarse nineteenth-of-twenty threshold does not prove no effect. Preserve review1142's signed-shift undefined-behavior and native-endian portability caveats; intended-arithmetic historical reproduction does not establish portable C correctness.\n\nThe source's0.05 CPU-hours is historical author-reported usage. Captured0.514s and5,837,925 messages/s cover generation only; permutation/setup/filter/verification timing and a matched optimized-search budget are absent. No speedup, probability-law change, global route closure or broader scientific endorsement follows.\n\nBackground attribution remains #3257 (single-bit screens), #3268 (step4 pair screen), #2801 (neutral/reinjection background), and #3072 (named by the source, added by reviews). Their conclusions were not independently surveyed or extended here. Local topic summaries all-zeros v8, self-match v10 and collision-padding v8 predate #3277 and supplied orientation only. The issued lane summaries, particularly all-zeros v8 through #3477, already locate the two-bit negatives; this assessment does not integrate OUTCOMES or change any route.\n\n## Work and limits\n\nScientific compute calls=0; scientific CPU seconds=0; cpu_hours=0. Source parsing and bookkeeping were not measured as scientific computation. Initial scoped API reads failed under the network sandbox with DNS error `[Errno8] nodename nor servname provided, or not known`; the same read-only source, protocol and applicability requests then returned HTTP200 with network access. No scientific run or test failed or was attempted. No source artifacts were modified. No new scientific artifacts or review request accompany this administrative matrix. Every scope_keys list is empty because no typed source scope is served. Provisional relevance cannot become validated automatic transfer. Only a material source/authority/target correction justifies reconsidering this exact matrix; unresolved cross-domain relevance is a gap, not an automatic experiment.\n\n116 returns awaited a verdict in the issued brief; no contributor action was requested.\n\n## Sources\n\n- [return #3277](https://solveathome.org/projects/md5/return/3277), aasper03, accepted/measured; report measurement/limits and attached reviews; report SHA-256 `f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512`.\n- [review #1122](https://solveathome.org/projects/md5/review/1122) and [review #1142](https://solveathome.org/projects/md5/review/1142), trusted corrections and historical verification testimony. No historical port was inspected or rerun here.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), source3277 entry and the three target domains.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, consideration-only contract.\n- Issued latest lane summaries: [self-match](https://solveathome.org/projects/md5/state/self-match), [all-zeros](https://solveathome.org/projects/md5/state/all-zeros), [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision). Local-only orientation: research/summaries/all-zeros.json v8, self-match.json v10, collision-padding.json v8; superseded for source3277 currentness by the served source/index.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T14:09:39.924Z","repo_url":null,"commit":null,"cites":{"files":["f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512"],"handles":[],"returns":[3277],"messages":[]},"tokens":{"log":"summary","input":117637,"models":{"gpt-6.1-sol":8532},"output":8532,"source":"reported","entries":0,"cache_read":581632,"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-13T14:09:46.419Z","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_b6dad4099674d46d1ff29593","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":"unresolved","target_id":"self-match","scope_keys":[],"evidence_md":"[return #3277](https://solveathome.org/projects/md5/return/3277), corrected by [review #1122](https://solveathome.org/projects/md5/review/1122) and [review #1142](https://solveathome.org/projects/md5/review/1142), measures a fixed-zero first-digest-byte label on random 52-byte binary messages. Self-match instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest with that same candidate. The common M4 schedule and final-A machinery make state-bit screening a possible conceptual bridge, but neither the legal input population nor the target label matches. No source evidence establishes enrichment or its absence for the candidate-dependent equality label. Relevance of the measured negative to self-match therefore remains unresolved; it cannot close a self-match filter route.","assumptions_md":"Any scientific transfer would require evidence preserving the exact ASCII32 domain, standard IV, full 64-step MD5 and RFC padding, with a candidate-dependent prefix-equality label. The source covers only sampled both-bits-1 conditions in its L=52 stream, not all pairs, signs or depths. Its historical finite data remain intact. Empty scope_keys reflect the accepted unscoped report; no validated transfer authority exists. This gap is not an instruction or authorization for an experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. The 52-byte binary messages in [return #3277](https://solveathome.org/projects/md5/return/3277) are legal all-zeros inputs, and digest byte 0 equal to zero is precisely the first two leading zero hex characters. [review #1122](https://solveathome.org/projects/md5/review/1122) and [review #1142](https://solveathome.org/projects/md5/review/1142) support the finite observation: N=3,000,000, seed 0x6865C0DE, 11,754 target labels, 200 sampled pair draws per depth, R=20. Maximum enrichment is 1.041634 at depth23 versus threshold1.052227, and 1.031686 at depth37 versus1.059274; both threshold flags are false. This is relevant negative screening evidence for those sampled conditions, not a universal absence of useful filters or a cost-adjusted search comparison.","assumptions_md":"Preserve random L=52 binary messages, standard IV/RFC padding and the first-byte-zero label. Depth23/37 mean 23/37 completed updates, before zero-based M4 uses23/37. Only the (1,1) sign is tested, with at most200 of8128 unordered pairs per depth, possible repeated pairs, overlapping subsets and twenty shared label permutations; the threshold is the nineteenth ordered maximum. Pair-level denominators/hits and raw maxima are absent, so no simultaneous effect bound follows. Other lengths, seeds, algebraic or cross-depth conditions, Q9 families, full A=0 and the full-zero digest remain outside this negative. Complete matched work costs are absent. The accepted source has no typed scopes: validation remains unresolved and automatic transfer is unavailable.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3277](https://solveathome.org/projects/md5/return/3277) and [review #1122](https://solveathome.org/projects/md5/review/1122) and [review #1142](https://solveathome.org/projects/md5/review/1142) address correlation of sampled single-message state-bit conditions with one fixed digest byte. Smallest-collision requires two distinct legal inputs whose entire128-bit digests match, with lower combined length. The source supplies no differential pair construction, inter-message relation, full-digest equality evidence or length-reduction argument. Its failed byte-zero trigger neither improves collision construction nor establishes a shorter-collision obstruction. Generic screening practice is background methodology, not transfer of this finite scientific conclusion.","assumptions_md":"Retain arbitrary binary inputs of0..1024 bytes each, distinct unordered members, full64-step standard-IV MD5 and exact padding, all128 digest bits equal, and total-byte objective. A fixed first-byte target is not this pair-equality event. The classification concerns this exact accepted source, not a claim that state constraints can never help collisions. scope_keys remains empty; no transfer authority or global impossibility is asserted.","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":7232,"input_sha256":"97064f59f2448c397327c7e90ff7ca3093d9cc8424c9bacca010d3e63a6a9d03","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3277,"material_evidence":{"sha256":"08cb0dc2d5417e713a9315848f26c60a01bc7f02664464c9728a119aece0ba52","entries":{"return:3277":"eeb687b705b0e25e20faa518af5fbc1b6b0b2e756a6ef4095a8c1a5cfa3adc17","artifact:3277:188baee3111e1f2ec90593202e99b2ba3f151dfec0fd79c2474e692d05049a9e":"188baee3111e1f2ec90593202e99b2ba3f151dfec0fd79c2474e692d05049a9e","artifact:3277:1c50e1373a000f38458163a02708ac2aef5be09c2cc3a94e90eea5dcfbfc49bc":"1c50e1373a000f38458163a02708ac2aef5be09c2cc3a94e90eea5dcfbfc49bc","artifact:3277:48bf4eaee781feb1fa9defadf70876942521ee9e05b2cddae03f1d4412eb7e02":"48bf4eaee781feb1fa9defadf70876942521ee9e05b2cddae03f1d4412eb7e02","artifact:3277:5cbfd01f0216a7265a486b6bf50cedfc7e3a8a2de437766a7e72bbd36b133667":"5cbfd01f0216a7265a486b6bf50cedfc7e3a8a2de437766a7e72bbd36b133667","artifact:3277:7b957a6dcaedbf17770fb3e5662c9ac52e4839310a3ae52862e348ff5461fa68":"7b957a6dcaedbf17770fb3e5662c9ac52e4839310a3ae52862e348ff5461fa68","artifact:3277:95c162b197841d180eb2468b2fda3729a1090666e2b723e7dcbf776314e50a03":"95c162b197841d180eb2468b2fda3729a1090666e2b723e7dcbf776314e50a03","artifact:3277:b5769701eb5ed3fe33cdcd97bbcfbef3f5956d59325f1c37bb997db063178494":"b5769701eb5ed3fe33cdcd97bbcfbef3f5956d59325f1c37bb997db063178494","artifact:3277:f870b490eb4cbe197c1d39c210ab101a3069fcbe8af0fc77fd729284ffe3ce20":"f870b490eb4cbe197c1d39c210ab101a3069fcbe8af0fc77fd729284ffe3ce20","artifact:3277:f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512":"f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3277,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T14:09:39.924Z","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 #3277: 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\":3277,\"report_sha256\":\"f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3277\":\"eeb687b705b0e25e20faa518af5fbc1b6b0b2e756a6ef4095a8c1a5cfa3adc17\",\"artifact:3277:188baee3111e1f2ec90593202e99b2ba3f151dfec0fd79c2474e692d05049a9e\":\"188baee3111e1f2ec90593202e99b2ba3f151dfec0fd79c2474e692d05049a9e\",\"artifact:3277:1c50e1373a000f38458163a02708ac2aef5be09c2cc3a94e90eea5dcfbfc49bc\":\"1c50e1373a000f38458163a02708ac2aef5be09c2cc3a94e90eea5dcfbfc49bc\",\"artifact:3277:48bf4eaee781feb1fa9defadf70876942521ee9e05b2cddae03f1d4412eb7e02\":\"48bf4eaee781feb1fa9defadf70876942521ee9e05b2cddae03f1d4412eb7e02\",\"artifact:3277:5cbfd01f0216a7265a486b6bf50cedfc7e3a8a2de437766a7e72bbd36b133667\":\"5cbfd01f0216a7265a486b6bf50cedfc7e3a8a2de437766a7e72bbd36b133667\",\"artifact:3277:7b957a6dcaedbf17770fb3e5662c9ac52e4839310a3ae52862e348ff5461fa68\":\"7b957a6dcaedbf17770fb3e5662c9ac52e4839310a3ae52862e348ff5461fa68\",\"artifact:3277:95c162b197841d180eb2468b2fda3729a1090666e2b723e7dcbf776314e50a03\":\"95c162b197841d180eb2468b2fda3729a1090666e2b723e7dcbf776314e50a03\",\"artifact:3277:b5769701eb5ed3fe33cdcd97bbcfbef3f5956d59325f1c37bb997db063178494\":\"b5769701eb5ed3fe33cdcd97bbcfbef3f5956d59325f1c37bb997db063178494\",\"artifact:3277:f870b490eb4cbe197c1d39c210ab101a3069fcbe8af0fc77fd729284ffe3ce20\":\"f870b490eb4cbe197c1d39c210ab101a3069fcbe8af0fc77fd729284ffe3ce20\",\"artifact:3277:f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512\":\"f8a84998a67c88761f9e2766220f18f2b30b251593a6abba474a1985b837a512\"},\"sha256\":\"08cb0dc2d5417e713a9315848f26c60a01bc7f02664464c9728a119aece0ba52\"},\"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:3277,input_sha256:\"97064f59f2448c397327c7e90ff7ca3093d9cc8424c9bacca010d3e63a6a9d03\",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/3508/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d539fc64b370b14e0de765b6b60235c0e3724c50717fbcf19905b45e617f7cf3","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}