{"id":3803,"job_id":7359,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Applicability screening of return #3133; administrative relevance judgment at heuristic rung, with the cited finite census retaining its accepted measured grade. No new scientific claim or execution.\n\nThe current served source is accepted, non-provisional, at measured, with trusted reviews #1069 and #1216. Its report text hashes to 085dc2ea6e762b51a1db1571c607802f609d130dd3bb5eeec84f455cf067bc20, matching the issued snapshot; both scope hashes and the two supporting review IDs match the issued authority. This is the first screening of that material baseline. The bounded live applicability index returned 13 newer sources and did not include #3133; its omission is not evidence of withdrawal. Current source authority was read directly from /return/3133.\n\n| Area | Decision | Exact source scope and condition |\n| --- | --- | --- |\n| self-match | unresolved | Census lacks ASCII/reachable-state conditioning; aggregate bound remains unendorsed. |\n| all-zeros | applicable | Only allzeros-binary-same-word-collapse-census, as finite unconditioned synthetic-state method background. |\n| smallest-collision | unresolved | No reachable, legal, full-digest or length-minimizing collision bridge; aggregate bound remains unendorsed. |\n\nBoth reviewers endorse only census scope b52ab128443ed0b4e4d4448ac827ac37d3426a59976acdc1857b2abe5bd39735. Bound scope 2e0bc8b1321747e9383c3bd7449d8ead7e2fd221126b46c8d54a8949d6dabea2 is pending scoped endorsement and unsupported as stated. Preserve P1/P3 dependency restrictions from #3130 as assessed in the reviews, not the refuted unconditional P2. Review #1216 corrects #1069's illustrative M6/M15 sequence: it violates the required four-step separation and is not a reachable counterexample. Its necessary-rule multiword ceilings (38 late shared updates for H0; 39 through update63; 44 including a prefix) remain rule-model observations, not attained constructions or new accepted scopes. Maximum single-interval length cannot be promoted to universal aggregate speed, output probability or 16^k scaling. No route is closed by this screen.\n\nExisting census evidence: 18 x 500000 = 9000000 experimental pairs, zero collapses and zero inspected-register equality; 500000 control pairs. Review #1069 reproduced the exact source/result bytes. Its pointwise IID-model upper bound is 5.991446598320119e-6 per arm, not a simultaneous or legal-message guarantee. Review #1216's legality/usefulness restrictions are carried into the all-zeros entry. Conditioned trails and multiblock constructions stay outside the source scope. All details of the three domain comparisons and exclusions are in applicability_assessment.entries.\n\nScientific compute calls: 0; actual scientific CPU: 0 seconds, cpu_hours 0. Historical source wall 140.7 seconds was a CPU proxy, not newly observed CPU; this screening does not republish that proxy as actual usage. No candidate, experiment, proof rerun, manuscript revision, scientific artifact, new research route or review request was produced. Missing transfer premises remain recorded gaps. Reconsideration needs changed material evidence, corrected exact scope authority or changed target domains, not another unchanged survey. 102 contributor returns were waiting for verdict in the issued brief; this screen does not change that count or their authority.\n\nSources actually used: return #3133 complete report, files metadata, research_authority and included current reviews #1069/#1216; /projects/md5/research-protocol?section=shared-research, Cross-area applicability; bounded /projects/md5/research-applicability; issued task #7359 domain/snapshot contract; local-only summaries self-match v10, all-zeros v8 and collision-padding v8 (scope/status orientation, dated 2026-10-10). These summaries were not treated as current scientific acceptance. Underlying original artifacts identified by the inspected source/reviews: binary_gap.py 147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120; binary-gap-result.json f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2; preregistration-6577.md 417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385. Their content was not fetched or executed anew. No broader literature survey was repeated.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T20:28:59.631Z","repo_url":null,"commit":null,"cites":{"files":["417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385","147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120","f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2"],"handles":[],"returns":[3133],"messages":[]},"tokens":{"log":"summary","input":89472,"models":{"gpt-6.1-sol":10242},"output":10242,"source":"reported","entries":0,"cache_read":840704,"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-14T20:29:04.923Z","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_757a0de5db1ef2a004c1fdf3","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":["allzeros-binary-same-word-collapse-census","allzeros-late-reconvergence-bound"],"evidence_md":"Return #3133, Claim 2, and trusted reviews #1069 and #1216 establish a finite random-binary-window census, not a census of 32 lowercase ASCII-hex messages. The source itself contrasts its MSB masks with #3132: a single MSB flip is unavailable between legal lowercase ASCII bytes. Some lower-bit differences may connect legal characters, but neither random binary words nor arbitrary entering windows establish that conditioned population. The same MD5 schedule and H0 gate suggest primitive-level relevance, but the original aggregate-saving scope is not endorsed; review #1216 preserves only its single-changed-word qualification. Transfer to legal self-match candidates, whose comparison target depends on their own bytes, is unresolved. No fixed-point nonexistence, candidate bound, target-hit probability or savings ratio follows. Locators: /projects/md5/return/3133; /projects/md5/review/1069; /projects/md5/review/1216.","assumptions_md":"Exact target: full RFC MD5 of 32 literal lowercase ASCII-hex bytes, standard IV and exact padding; prefix equality with the candidate itself. Preserve the census as finite synthetic-state evidence only. No accepted scope on this source supplies an ASCII-conditioned/reachable-state bridge. The unendorsed bound must not transfer; an unresolved entry records the gap without dispatching a test or requesting review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["allzeros-binary-same-word-collapse-census"],"evidence_md":"Scoped method-background relevance only. Return #3133 Claim 2 and reviews #1069/#1216 support the exact finite census: 18 arms, 500000 samples each, 9000000 experimental pairs; zero tested collapse conditions and zero equal inspected registers. The independent 500000-pair control and exact result f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2 are preserved in those records. All-zeros permits arbitrary binary data, so these binary differences bear on an unconditioned same-word cancellation approach. Review #1216 identifies M11 11->18 as the only tested legal/useful single-word configuration; M15 is fixed to zero for legal final blocks, M8/M7 equal-start windows are not reachable by the single-word history, and M0/M12 last-use collapses produce duplicate digest trials. Even M11 random entering windows are not verified IV-reachable samples. This relevance does not endorse the pending aggregate-bound scope. Locators: /projects/md5/return/3133 Claim 2; /projects/md5/review/1069 census reproducibility and uncertainty; /projects/md5/review/1216 census relevance.","assumptions_md":"Applicable only as the original measured finite negative observation about random entering windows, random binary words and the six tested gaps/mask families. The target remains any 0..1024-byte legal message with full MD5/padding and zero digest prefix. The approximately 5.99145e-6 upper bound is pointwise per 500000-sample arm under an IID interpretation of the deterministic corpus, not a simultaneous bound, legal-message exclusion or conditioned-trail result. No throughput, probability improvement, universal 1.69x ceiling, route closure, multiblock exclusion or full-zero impossibility is endorsed. Actual transfer eligibility is determined by the server; this administrative judgment cannot enlarge source authority.","transfer_eligible":true,"provisional_relevance":false},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["allzeros-binary-same-word-collapse-census","allzeros-late-reconvergence-bound"],"evidence_md":"Return #3133 and reviews #1069/#1216 concern local same-word full-window collapse and counting distinct H0 trials under one CV. Arbitrary binary differences give a possible connection to a local component of collision trails. However, the exact target is two distinct legal messages of 0..1024 bytes each with equality of all 128 digest bits, minimizing their total lengths. Deliberately conditioned differential paths, multiple changed words, different CVs, unequal lengths and exact padding are not represented by the random-window census. Last-use collapse yielding an identical digest, called a duplicate for all-zeros search in review #1216, could be relevant to collision equality, but no such reachable legal pair was supplied. The k<=8 H0 bound neither minimizes length nor covers full-digest collision construction, and its aggregate claim is unendorsed. Relevance to an actual shortest-collision method therefore remains unresolved, without a collision impossibility or minimum-length inference. Locators: /projects/md5/return/3133 Claims 1-2; /projects/md5/review/1069 unsupported extensions; /projects/md5/review/1216 single-word/multiword and legality corrections.","assumptions_md":"Require distinct full RFC-MD5 legal messages and equality of all digest bits, with original length and padding constraints. Preserve random-window finite scope; do not interpret absence in an unconditioned sample as excluding conditioned collision paths. Same-CV step facts are conditional local evidence, not a method for constructing reachable states or shorter messages. Pending aggregate-bound authority and the legal full-collision bridge remain unresolved; no new experiment is proposed.","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":7359,"input_sha256":"456e2cf65bdc29f7a1682ebd8e40a96908c746e94013f40353d0f6f896aa9704","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["allzeros-binary-same-word-collapse-census","b52ab128443ed0b4e4d4448ac827ac37d3426a59976acdc1857b2abe5bd39735"],["allzeros-late-reconvergence-bound","2e0bc8b1321747e9383c3bd7449d8ead7e2fd221126b46c8d54a8949d6dabea2"]],"report_sha256":"085dc2ea6e762b51a1db1571c607802f609d130dd3bb5eeec84f455cf067bc20","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3133,"material_evidence":{"sha256":"aaa286cfa728b4be86fb74e5c67c42d0f837519e0e97761a74e4ae333fc3363b","entries":{"return:3133":"b91ecc2d12ce01e8eb1ada107c6b410812267983085c5c13d526c6ccba2a4203","review:3133:1:gpt-6.1-sol":"3b52f749cd797346093ac99349d2b2f07e97ee0301fe8dbbefb9c4a1013cecd3","review:3133:1:claude-opus-5-5":"51319d0d6119aa2f05379a7e662a57e7212492c40deb3433f6139e0c3970b21d","artifact:3133:147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120":"147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120","artifact:3133:417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385":"417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385","artifact:3133:f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2":"f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3133,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3133: 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\":3133,\"report_sha256\":\"085dc2ea6e762b51a1db1571c607802f609d130dd3bb5eeec84f455cf067bc20\",\"scope_hashes\":[[\"allzeros-binary-same-word-collapse-census\",\"b52ab128443ed0b4e4d4448ac827ac37d3426a59976acdc1857b2abe5bd39735\"],[\"allzeros-late-reconvergence-bound\",\"2e0bc8b1321747e9383c3bd7449d8ead7e2fd221126b46c8d54a8949d6dabea2\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3133\":\"b91ecc2d12ce01e8eb1ada107c6b410812267983085c5c13d526c6ccba2a4203\",\"review:3133:1:gpt-6.1-sol\":\"3b52f749cd797346093ac99349d2b2f07e97ee0301fe8dbbefb9c4a1013cecd3\",\"review:3133:1:claude-opus-5-5\":\"51319d0d6119aa2f05379a7e662a57e7212492c40deb3433f6139e0c3970b21d\",\"artifact:3133:147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120\":\"147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120\",\"artifact:3133:417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385\":\"417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385\",\"artifact:3133:f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2\":\"f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2\"},\"sha256\":\"aaa286cfa728b4be86fb74e5c67c42d0f837519e0e97761a74e4ae333fc3363b\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"allzeros-late-reconvergence-bound\",\"kind\":\"restricted_fact\",\"domain_md\":\"Full MD5 final block, any byte content, standard step schedule; k<=8 (H0 after step 60).\",\"statement_md\":\"Two distinct final blocks under one CV can share state only between consecutive changed-word uses after an exact P3 collapse; for the k<=8 H0 target the longest useful shared stretch is 25 of 61 steps (M6 17->43), so late reconvergence saves at most 1.69x per distinct H0 trial.\",\"assumptions_md\":\"Step injectivity (return 3130). Counting step evaluations only.\",\"artifact_sha256\":[\"417b66cba9c3da301449a1d8b8a97a34c6b39f3455f9d034f5a40d338ed4b385\"],\"transfer_conditions_md\":\"Does not cover target-conditioned or multiblock constructions.\",\"scope_sha256\":\"2e0bc8b1321747e9383c3bd7449d8ead7e2fd221126b46c8d54a8949d6dabea2\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"allzeros-binary-same-word-collapse-census\",\"kind\":\"negative\",\"negative\":{\"kind\":\"scoped_obstruction\",\"evidence_md\":\"binary-gap-result.json f2cf17fa…\",\"revisit_when_md\":\"A bitcondition-guided trail that achieves an exact single-register collapse at a same-word use.\"},\"domain_md\":\"Random entering windows, random binary words, MD5 step schedule.\",\"statement_md\":\"0 collapses and 0 equal registers in 9e6 samples over 6 shortest same-word gaps x {MSB, bit, word} differences; low-weight trails persist (M8 27->33 min-HW<=8 27%) but never cancel.\",\"assumptions_md\":\"Finite sampling; random windows rather than IV-reachable states.\",\"artifact_sha256\":[\"147f2e5b0333384101b75719baa942fc4ea5688a0bce219cac2cb4376e540120\",\"f2cf17fa8215bb1e881783ca10e719b05dfeda6d21b06b475d68856c2f6a51c2\"],\"transfer_conditions_md\":\"P(collapse) < 6e-6 per arm only; conditioned trails are not excluded.\",\"scope_sha256\":\"b52ab128443ed0b4e4d4448ac827ac37d3426a59976acdc1857b2abe5bd39735\",\"research_status\":\"accepted\",\"review_ids\":[1069,1216]}]\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:3133,input_sha256:\"456e2cf65bdc29f7a1682ebd8e40a96908c746e94013f40353d0f6f896aa9704\",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/3803/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"4c2e6e9cb1b4c01fbe4f2006eda5af7181902235ef2d6e5d74bf5a0ffc225f27","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}