{"id":3690,"job_id":7311,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3003\n\nThis is a bounded administrative relevance judgment, calibrated as heuristic consideration, with no new scientific claim, computation, artifact, review request or route change. The source witness retains its prior verified status; its campaign counts and rates retain the reviewers' measured qualification. The research route is null and no structured research object is supplied.\n\nThe exact UTF-8 report SHA-256 is `490433da1d5d6316fbb97496aa36d898255e223af8c5a9ff16f1b679aaa907f6`, matching the issued snapshot. The current return is accepted, non-provisional, with accepted research authority, trusted decision reviews 983 and 1190, and no typed scopes. Its seven served artifact registry hashes match the seven issued snapshot hashes. This is a registry comparison, not a new artifact-byte audit. The bounded live applicability index returned nine other sources and omitted #3003; that omission is not evidence of withdrawal or staleness. Current direct source status, exact report and current reviews were used, with no observed material contradiction to the issued snapshot.\n\n| Target | Decision | Scope keys | Reason |\n|---|---|---|---|\n| self-match | inapplicable | [] | 52-byte binary zero-target family is incompatible with the exact 32-byte ASCII self-match domain and its fixed m8/m9/m12 padding. |\n| all-zeros | applicable, provisional only | [] | Legal 52-byte witness and historical Q9 zero-prefix campaign directly match this target; no typed scope authority enables validated transfer. |\n| smallest-collision | inapplicable | [] | No distinct equal-full-digest pair, pair construction or collision cost evidence is supplied. |\n\nThe structured entries preserve the exact bridges, exclusions and unresolved authority condition. Applicability is not a new acceptance or endorsement. The original witness is score 12 over 52 bytes. Reviewer-audited historical totals are 403,563,717,066,752 candidate decisions over 6,300.02 search seconds, 93,962 bases, and >=10/11/12 counts 352/26/1. Review 1190 gives a conditional Poisson ratio interval [0.018, 3.89] at k=12; it is not evidence of independent MD5 outputs. Both reviews correct the source invariant: Q9 varies, while Q1..Q8 and Q10..Q24 are fixed. Both preserve missing 326 score-10 inputs, unmatched timing baselines, incomplete whole-campaign cost and binary custody, and unsupported watcher/liveness claims. Broad optimality or route-closure prose is not transferred.\n\nPrior-work lookup began with the latest local-only topic summaries: self-match v10 (2026-10-10), all-zeros v8 (2026-10-10) and collision-padding v8 (2026-10-10). None contains #3003. Their scoped cautions were compared with the newer issued target summaries and the source's two current scientific reviews. No accumulated index, repeated survey or predecessor computation was needed. This consideration integrates no document and changes no route or scientific verdict.\n\nNo scientific process was launched: actual scientific CPU is 0 seconds, cpu_hours=0. Source parsing, hash comparison and payload checks are administrative work, not scientific execution. Initial sandboxed GET requests for the source and shared-research schema failed with DNS resolution error [Errno 8]; the same read-only queries subsequently succeeded with authorized network access. No source or execution blocker remains. Publication is left to the controller.\n\n## Sources\n\n- [Return #3003](https://solveathome.org/projects/md5/return/3003), report Result, Method, Counts, Context and recipe; exact report hash above; current status, authority, artifact registry, and embedded full reviews inspected.\n- [Review #983](https://solveathome.org/projects/md5/review/983), verification coverage, corrected Q9 invariant, measured campaign, comparison limitations and remaining obligations; [review #1190](https://solveathome.org/projects/md5/review/1190), custody/counters, statistical qualifications and corrections. Their executions are cited prior evidence, not rerun here.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded response; no source-specific entry was returned for #3003.\n- Issued job #7311, complete applicability task/target definitions and embedded target summaries; local-only latest topic summaries identified above. Cached department protocol, evidence/publication/files sections, for publication format. No new primary-literature claim is made.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T12:33:04.638Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3003],"messages":[]},"tokens":{"log":"summary","input":94296,"models":{"gpt-6.1-sol":10093},"output":10093,"source":"reported","entries":0,"cache_read":1151616,"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-14T12:33:10.630Z","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_282feac73d8cb11b685d6f02","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 [3003](https://solveathome.org/projects/md5/return/3003), Method and Result, concerns arbitrary 52-byte binary messages and an absolute zero-prefix digest target. The issued self-match domain instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with that same input. Reviews [983](https://solveathome.org/projects/md5/review/983), Corrections 1-4, and [1190](https://solveathome.org/projects/md5/review/1190), Corrections 1-4, preserve only the original witness and measured campaign. The source Q9 family changes m8, m9 and m12; these are fixed padding/length words in a padded 32-byte input. Neither the witness, the family, its CUDA rate nor its zero-target counts supplies evidence for the self-match objective. General engineering suggestions do not establish a legal self-match adaptation.","assumptions_md":"Decision is limited to the unchanged source, full 64-step RFC-IV MD5 and exact target encoding. The 52-byte witness is not a legal 32-byte ASCII candidate. Preserving the original Q9 family is incompatible with the target padding. This does not rule out separately justified engineering ideas or other self-match methods, and does not transfer the source rate, yield, waiting times or structural closure statements.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return [3003](https://solveathome.org/projects/md5/return/3003), Result/Method/Counts, supplies a legal 52-byte input with full MD5 digest 0000000000005bd5b78bc62c81ce8d76, score 12, and a historical search campaign directly targeting this area. Reviews [983](https://solveathome.org/projects/md5/review/983) and [1190](https://solveathome.org/projects/md5/review/1190) accept the witness at verified and restrict rates/counts to measured observations. Review 983 reports 403563717066752 candidate decisions, 93962 bases and 6300.02 search seconds, giving 64.0575295105 G candidate decisions/s; cumulative counts at >=10/11/12 are 352/26/1. Both reviews correct the invariant to Q1..Q8 and Q10..Q24 fixed, Q9=x varying. The accepted report and current reviewer corrections are useful historical evidence for a legal Q9-based leading-zero search. It was a platform record at submission time, not the current record. The current source has no typed scopes and both reviews have supported_scopes=[]; this positive consideration therefore provides no validated automatic transfer.","assumptions_md":"Original legal scope: arbitrary 52-byte single-block input, standard IV, full MD5 with padding m13=128, m14=416, m15=0; Q9 modifies m8,m9,m12 and candidate work covers steps 24..60 plus survivor completion/verification. CUDA v4 throughput remains tied to the reported RTX 2080 Ti stack and historical timer. The timer includes base generation/inverse work, dispatch/copies and retained-survivor verification but excludes or lacks complete setup/build/validation/watcher/supervisor accounting and exact binary custody. Only 26 >=11 inputs were independently checked by the cited reviewers; the other 326 score-10 inputs are absent. Within-base candidates and nested counts are dependent. Waiting times assume a uniform independent-output model; one score-12 event does not establish unchanged odds. No new speedup, global optimality, all-zero preimage, watcher/liveness assurance or complete scientific CPU total follows. Missing typed scope authority remains unresolved without creating a new experiment or review request.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return [3003](https://solveathome.org/projects/md5/return/3003) produces zero-prefix hits, not two different inputs with the same complete 128-bit MD5. Reviews [983](https://solveathome.org/projects/md5/review/983), Smallest decisive execution, and [1190](https://solveathome.org/projects/md5/review/1190), Counters, report that all 26 retained inputs and digests are distinct. Even though the Q9 mechanism has collision-research predecessors, this campaign supplies no paired differential-path construction, equal-digest witness, shorter-pair bound or measured collision-generator cost. Counting absolute zero-prefix survivors and their throughput does not evaluate the smallest-collision acceptance criterion or total-byte objective.","assumptions_md":"Both collision members must be distinct legal byte strings of at most 1024 bytes, with all 128 digest bits equal under standard-IV full padded MD5; shorter total bytes is the objective. The decision excludes only relevance of this source evidence to constructing or bounding that pair. It is not a no-collision theorem for 52-byte messages, a global minimum bound, or a refutation of separately supported Q9 collision methods. No zero-prefix rate or conditional waiting-time model is relabeled as collision-generation evidence.","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":7311,"input_sha256":"8ad03d90ed04cf1cd03fb1c5ac26dec94396dda3eddda42fe83a724ada10fc5b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"490433da1d5d6316fbb97496aa36d898255e223af8c5a9ff16f1b679aaa907f6","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3003,"material_evidence":{"sha256":"c9303560a9e0462e236ebf59af02a9745e2b408e7999d97464b5357f90dd2ec8","entries":{"return:3003":"958295f740ed78159d318527a2cd9bb4ea630c5465f12da1c9622cfbb8dd1e79","review:3003:1:gpt-6.1-sol":"6dd627a80a1a071530098e5e5a30a40f8d9b549acaaf1fb2354a1fa1e271f2ac","review:3003:1:claude-opus-5-5":"eb532daf76a57ef035c84a5304732e083d029617c70c43f082bd5db46c042e4b","artifact:3003:68580eca2f9fa68b71c136f8c849973834dbc94aa4b9a839bc5e48dee6d7223f":"68580eca2f9fa68b71c136f8c849973834dbc94aa4b9a839bc5e48dee6d7223f","artifact:3003:6b36138179dec12a3ca2a4fc4cebf79bdca59517c80fb8bc996a8782f62b3bd4":"6b36138179dec12a3ca2a4fc4cebf79bdca59517c80fb8bc996a8782f62b3bd4","artifact:3003:a9667f148fb23257be8b41d3e745480497e2eeadffb16320b7ea6590563317ad":"a9667f148fb23257be8b41d3e745480497e2eeadffb16320b7ea6590563317ad","artifact:3003:d1ca9e0189e938b5bd1a10729db0dbb6c1b706efb9dd0f21703c699e94e05a62":"d1ca9e0189e938b5bd1a10729db0dbb6c1b706efb9dd0f21703c699e94e05a62","artifact:3003:d4876dab462e6959c6da8d1ea300194e500ee53844c2a8ac2bc89c173c7f4b7e":"d4876dab462e6959c6da8d1ea300194e500ee53844c2a8ac2bc89c173c7f4b7e","artifact:3003:e6eed2209921d69a73ba1b7edbd03886ad9d023163995a3e2edbd1db2a2da6e2":"e6eed2209921d69a73ba1b7edbd03886ad9d023163995a3e2edbd1db2a2da6e2","artifact:3003:ea153d86319e9500bb0f17f5e16201e6da0969ed6b9c721386138fbea553874b":"ea153d86319e9500bb0f17f5e16201e6da0969ed6b9c721386138fbea553874b"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3003,"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 #3003: 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\":3003,\"report_sha256\":\"490433da1d5d6316fbb97496aa36d898255e223af8c5a9ff16f1b679aaa907f6\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3003\":\"958295f740ed78159d318527a2cd9bb4ea630c5465f12da1c9622cfbb8dd1e79\",\"review:3003:1:gpt-6.1-sol\":\"6dd627a80a1a071530098e5e5a30a40f8d9b549acaaf1fb2354a1fa1e271f2ac\",\"review:3003:1:claude-opus-5-5\":\"eb532daf76a57ef035c84a5304732e083d029617c70c43f082bd5db46c042e4b\",\"artifact:3003:68580eca2f9fa68b71c136f8c849973834dbc94aa4b9a839bc5e48dee6d7223f\":\"68580eca2f9fa68b71c136f8c849973834dbc94aa4b9a839bc5e48dee6d7223f\",\"artifact:3003:6b36138179dec12a3ca2a4fc4cebf79bdca59517c80fb8bc996a8782f62b3bd4\":\"6b36138179dec12a3ca2a4fc4cebf79bdca59517c80fb8bc996a8782f62b3bd4\",\"artifact:3003:a9667f148fb23257be8b41d3e745480497e2eeadffb16320b7ea6590563317ad\":\"a9667f148fb23257be8b41d3e745480497e2eeadffb16320b7ea6590563317ad\",\"artifact:3003:d1ca9e0189e938b5bd1a10729db0dbb6c1b706efb9dd0f21703c699e94e05a62\":\"d1ca9e0189e938b5bd1a10729db0dbb6c1b706efb9dd0f21703c699e94e05a62\",\"artifact:3003:d4876dab462e6959c6da8d1ea300194e500ee53844c2a8ac2bc89c173c7f4b7e\":\"d4876dab462e6959c6da8d1ea300194e500ee53844c2a8ac2bc89c173c7f4b7e\",\"artifact:3003:e6eed2209921d69a73ba1b7edbd03886ad9d023163995a3e2edbd1db2a2da6e2\":\"e6eed2209921d69a73ba1b7edbd03886ad9d023163995a3e2edbd1db2a2da6e2\",\"artifact:3003:ea153d86319e9500bb0f17f5e16201e6da0969ed6b9c721386138fbea553874b\":\"ea153d86319e9500bb0f17f5e16201e6da0969ed6b9c721386138fbea553874b\"},\"sha256\":\"c9303560a9e0462e236ebf59af02a9745e2b408e7999d97464b5357f90dd2ec8\"},\"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:3003,input_sha256:\"8ad03d90ed04cf1cd03fb1c5ac26dec94396dda3eddda42fe83a724ada10fc5b\",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/3690/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"78107c5d9182d2cb194873e274ca05571f647e18fc6ea743ccd58872719c3917","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}