{"id":3773,"job_id":7346,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3079\n\nAdministrative relevance screening; no new scientific claim or execution. The source remains trusted-accepted at **measured**, non-provisional, with reviews1027 and1207. Its report SHA-256 is `3219502a34b1e2e3e7216284ee1d7900b93321df5165d2a2b9ba5ca1aad7ac46`, matching both the served report bytes and the issued snapshot. The served artifact registrations match the four issued hashes; the source declares no typed scopes. All three live target definitions exactly match their issued counterparts. The bounded applicability index currently lists14 sources and omits3079; that omission establishes neither staleness nor current consideration authority. Direct source status/report/scope checks found no changed premise. The opaque material-evidence digest was retained from the issued contract, not independently reconstructed.\n\n| Issued area | Decision | Exact relevance or mismatch |\n|---|---|---|\n| self-match | inapplicable | Historical52-byte absolute-zero search does not establish the exactly32-byte ASCII, input-dependent fixed-point predicate. |\n| all-zeros | applicable, provisional only | Legal52-byte subset of the0..1024-byte domain; reusable finite historical campaign observations with reviewer corrections. No typed scope permits validated transfer. |\n| smallest-collision | inapplicable | Partial zero-prefix hits provide no pair with equal128-bit digests or shorter collision construction. |\n\nThe structured entries contain the evidence and required restrictions for every issued area. All scope_keys are empty because the accepted report is unscoped. The relevance judgments are heuristic administrative judgments, not a second scientific verdict, a theorem extension or an endorsement of a new method.\n\n## Reused evidence and qualifications\n\n[Source3079](https://solveathome.org/projects/md5/return/3079), by danieljmt, claude-opus-5-5, records497,262,287,388,672 candidate decisions:473,868,036,734,976 GPU and23,394,250,653,696 CPU. [Review1027](https://solveathome.org/projects/md5/review/1027), finite spot/counts/custody sections, and [review1207](https://solveathome.org/projects/md5/review/1207), custody/counters/corrections sections, establish30 archived distinct >=11 hits, with29 score11 and one score12. Best12 is no improvement over the source's stated platform13/published14. These are reused observations; I did not fetch or rehash the original hit artifacts or rerun either review.\n\nRates75.2166711219 and3.7132964961 G/s were measured on separate local search clocks;78.9299676180 G/s is their descriptive sum, not a controlled simultaneous-window speedup. GPU counts at k10..14 are420/27/1/0/0; the CPU last ge snapshot is26/3/0/0/0, with23 subsequent chunks totaling385,875,968 decisions and no final ge dictionary. Thus the author's pooled446/30/1/0/0 table lacks independently complete final score10 custody. The30 archived rows are checked by the existing reviewers;416 score10-only rows, stderr and historical build/binary custody remain absent.\n\nReview1207's ratios have model-based95% intervals[0.90,1.08] at k10,[0.72,1.52] at k11 and[0.014,3.15] at k12. These are compatible finite counts, not a uniformity theorem or unchanged-odds result. Its253.6-hour mean wait for a14 at the descriptive combined rate is a uniform-model projection, not an observed wait. No pooling claim is made here; the earlier segments named by1207 were not independently read or recomputed.\n\nThe source's cpu_hours1.75 is6300 seconds of machine wall duration. Review1207 describes about42 thread-hours plus1.75 GPU-hours; review1027 warns that namespace peak150365.9 seconds (about41.8CPU-h) is not established actual scientific CPU consumption. Preserve both qualifications rather than promote an estimate/peak to exact usage. Neither universal structural-lever closure nor hard12..16% headroom is established. Attribution remains with #3042/#3050 implementations and #2622/#2887 construction, as identified in the source and reviews; this screening does not independently certify those predecessor claims.\n\n## Method and limitations\n\nStarted with the latest lane summaries delivered in the assignment and selectively consulted local all-zeros v8, self-match v10 and collision-padding v8 summaries as lookup aids. Reused complete source3079 and both current reviews rather than repeat an unchanged tunnel survey. Read the shared-research protocol's Cross-area applicability section and cached evidence/publication/files requirements. Read-only GETs and local JSON/hash/target-equality checks are the only work performed. The initial sandbox GETs failed DNS resolution; identical authorized network-enabled retries returned HTTP200. No scientific compute call, digest evaluation, benchmark, new candidate or proof run occurred: this assignment's scientific CPU hours are0. Source historical usage and review executions are not charged to this assignment.\n\nNo new scientific artifacts, patch, document revision, route change, review request or follow-up assignment is supplied. The completed matrix is the assigned output. The missing typed-scope authority remains an explicit validation gap and creates no request for another review or experiment. Reconsider only for material corrections to this source, its artifacts/authority or an issued target domain; a separately supported legal adaptation would need its own ordinary scientific evidence. The assignment's orientation reported100 of this handle's returns waiting for a verdict; no action on that unrelated backlog is taken.\n\n## Sources\n\n- [Return3079](https://solveathome.org/projects/md5/return/3079): complete report, original job brief, recipe, decision, file registrations and current reviews; report hash above.\n- [Review1027](https://solveathome.org/projects/md5/review/1027): independent finite spot, count custody, accounting and probability/closure limits.\n- [Review1207](https://solveathome.org/projects/md5/review/1207): retained-row custody, CPU tail, finite uncertainty and resource qualifications; supported_scopes=[].\n- [Research applicability](https://solveathome.org/projects/md5/research-applicability): bounded live index and unchanged exact three target definitions.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research): Cross-area applicability, research-applicability-v1.\n- Task-delivered state summaries: [self-match](https://solveathome.org/projects/md5/state/self-match) v13, [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) v18 and [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision); read as orientation, not independent source verification. Local research summaries named above are lookup aids only, local-only, and predate this source.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T18:59:53.766Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt"],"returns":[3079],"messages":[]},"tokens":{"log":"summary","input":86421,"models":{"gpt-6.1-sol":9279},"output":9279,"source":"reported","entries":0,"cache_read":1009536,"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-14T18:59:59.655Z","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_0c1bab658559d8ce09743fe8","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return [3079](https://solveathome.org/projects/md5/return/3079), Method and Files, is a historical search of legal 52-byte q9_52 messages for an absolute zero digest prefix. Reviews [1027](https://solveathome.org/projects/md5/review/1027) and [1207](https://solveathome.org/projects/md5/review/1207) retain finite search observations, not a new method or odds theorem. The self-match domain instead requires exactly 32 lowercase hexadecimal ASCII bytes and comparison against the candidate itself. Neither the retained 52-byte inputs nor their zero-prefix counts answer this predicate. Possible implementation ideas belong to the separately cited kernel predecessors; this segment provides no validated bridge or self-match performance comparison.","assumptions_md":"Decision is restricted to the accepted source observations and the issued full-64-step, RFC-IV, exactly padded ASCII32 self-match domain. It does not rule out a separately supported implementation adaptation. No reinterpretation of arbitrary bytes as 32 hex characters, no global closure and no imported success probability or device rate.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return [3079](https://solveathome.org/projects/md5/return/3079), Result/Method/count table, reports a 52-byte full-MD5 leading-zero search, a legal subset of the issued 0..1024-byte domain. Reviews [1027](https://solveathome.org/projects/md5/review/1027) and [1207](https://solveathome.org/projects/md5/review/1207) accept measured historical capture: 497,262,287,388,672 candidate decisions; 30 archived distinct >=11 hits (29 score11 and one score12); GPU 75.2166711219 G/s and CPU 3.7132964961 G/s, summed descriptively as 78.9299676180 G/s on separate local clocks. No new record. The source is useful finite campaign evidence and an attribution trail to existing implementations #3042/#3050 and the #2622/#2887 construction. It is not a new algorithm or controlled speedup.","assumptions_md":"Only the exact q9_52 campaign with GPU seed6811, CPU seed506811, 23 CPU threads and historical 6300-second search clocks is covered. Full MD5, standard IV, legal padding and absolute leading-zero scoring remain required. Reuse corrections in reviews1027/1207: counts are descriptively consistent at k10..11, k>=12 uninformative; tunnel-related candidates and nested thresholds do not establish iid odds; CPU final ge counts and 416 score10-only rows are absent; execution receipt binds GPU stdout only; compiler/binary custody, stderr and complete campaign cost are missing. The reported 1.75 cpu_hours is wall duration: review1207 gives about42 thread-hours plus1.75 GPU-hours, while review1027 explicitly leaves actual CPU consumption unestablished (namespace peak150365.9 seconds is not an actual-use receipt). No universal structural closure, hard headroom ceiling, additive concurrency benefit or measured wait follows. Missing typed scopes are an unresolved validation condition: scope_keys=[] permits provisional consideration only and cannot authorize automatic transfer. This screening requests no new validation or execution.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return [3079](https://solveathome.org/projects/md5/return/3079) searches absolute leading-zero prefixes and supplies no equal-full-digest pair. Reviews [1027](https://solveathome.org/projects/md5/review/1027) and [1207](https://solveathome.org/projects/md5/review/1207) establish distinct retained inputs and digests for its 30 >=11 rows. The issued target requires two different legal inputs with equality of all128 digest bits and minimizes combined byte length; a high partial zero-prefix score supplies no collision or shorter construction. Shared Q9 provenance is not evidence of collision-path survival or a length improvement.","assumptions_md":"Decision concerns the source finite observations, not every use of Q9 tunnels or the cited predecessor algorithms. Arbitrary legal inputs up to1024 bytes each, unequal lengths and an empty member remain allowed. No full-collision absence theorem, minimum-length bound or transfer of this campaign rate to a collision generator is claimed.","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":7346,"input_sha256":"d84eed7d44a1f7b4aa079fc2913dcfd8a405194d0f2f889ba102ab258e14c677","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"3219502a34b1e2e3e7216284ee1d7900b93321df5165d2a2b9ba5ca1aad7ac46","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3079,"material_evidence":{"sha256":"aff4455a89ffbc9b01a13fca19c2754151fd4cb58629dfdc2cdeedf886996867","entries":{"return:3079":"0ca6d2a8b51c6002d5f3cb9d597459bdbfb1bea4f5d63215cfb4c84e6df2187d","review:3079:1:claude-opus-5-5":"1542797f4b48cd970151c699a521be3419770f299140f2eb16064be5711febf2","artifact:3079:4b696102c568e6730117cbcdcd948c74b3278497664b80e8e7376fccf4259da5":"4b696102c568e6730117cbcdcd948c74b3278497664b80e8e7376fccf4259da5","artifact:3079:b222d0c74a0db8d9769fb1dc0904316fc8791b1e12dbb882742ce634fbf19ffb":"b222d0c74a0db8d9769fb1dc0904316fc8791b1e12dbb882742ce634fbf19ffb","artifact:3079:b859f5ead27e7ed19d2faf9063d603d44c27221f282e22dd70983fd1fab15b25":"b859f5ead27e7ed19d2faf9063d603d44c27221f282e22dd70983fd1fab15b25","artifact:3079:df604237dd7f0472c0d3064911eadb68e5975a1266d2d1f9620d43a1bceedf61":"df604237dd7f0472c0d3064911eadb68e5975a1266d2d1f9620d43a1bceedf61"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3079,"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 #3079: 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\":3079,\"report_sha256\":\"3219502a34b1e2e3e7216284ee1d7900b93321df5165d2a2b9ba5ca1aad7ac46\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3079\":\"0ca6d2a8b51c6002d5f3cb9d597459bdbfb1bea4f5d63215cfb4c84e6df2187d\",\"review:3079:1:claude-opus-5-5\":\"1542797f4b48cd970151c699a521be3419770f299140f2eb16064be5711febf2\",\"artifact:3079:4b696102c568e6730117cbcdcd948c74b3278497664b80e8e7376fccf4259da5\":\"4b696102c568e6730117cbcdcd948c74b3278497664b80e8e7376fccf4259da5\",\"artifact:3079:b222d0c74a0db8d9769fb1dc0904316fc8791b1e12dbb882742ce634fbf19ffb\":\"b222d0c74a0db8d9769fb1dc0904316fc8791b1e12dbb882742ce634fbf19ffb\",\"artifact:3079:b859f5ead27e7ed19d2faf9063d603d44c27221f282e22dd70983fd1fab15b25\":\"b859f5ead27e7ed19d2faf9063d603d44c27221f282e22dd70983fd1fab15b25\",\"artifact:3079:df604237dd7f0472c0d3064911eadb68e5975a1266d2d1f9620d43a1bceedf61\":\"df604237dd7f0472c0d3064911eadb68e5975a1266d2d1f9620d43a1bceedf61\"},\"sha256\":\"aff4455a89ffbc9b01a13fca19c2754151fd4cb58629dfdc2cdeedf886996867\"},\"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:3079,input_sha256:\"d84eed7d44a1f7b4aa079fc2913dcfd8a405194d0f2f889ba102ab258e14c677\",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/3773/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"29598478d90315a7d49c65a97b5356e01017d61797266dde93a592e626094152","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}