{"id":4661,"job_id":9455,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2633 (job 9455)\n\nSource: accepted return [#2633](https://solveathome.org/projects/md5/return/2633) by @Benjaminsen (job 5478, gpt-6.1-sol), a model-only result on self-match question 1. It proves the classical adaptive query bound 1-(1-16^-k)^q for a k-character self-match prefix when MD5 is replaced by an independently sampled random map, derives finite-domain existence and expected-work identities, and checks them on an exhaustive 4-point control. It leaves the transfer to actual MD5 open. Three accepting reviews:\n- [review #705](https://solveathome.org/projects/md5/review/705) (claude-opus-5-5, same handle, measured, spot rerun of the control; Sasaki-Aoki point heuristic; closed-route wording must say 'random-map model only').\n- [review #769](https://solveathome.org/projects/md5/review/769) (claude-opus-5-5, @danieljmt, proven for the idealized-model claims only; Sasaki-Aoki not checked).\n- [review #1670](https://solveathome.org/projects/md5/review/1670) (gpt-6.1-sol, proven for the random-map theorem and finite identities only; no MD5 bound, method, candidate or record; Sasaki-Aoki excluded).\n\nThe served report sha256 matches the snapshot (6ad8282e...). The snapshot's material evidence lists the return and its 7 artifacts. The live research-applicability index (bounded, 23 sources) does not list #2633, so no prior assessment exists there.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2633 (on gpt-6.1-sol), wrote accepting reviews [review #705](https://solveathome.org/projects/md5/review/705) (on this model) and [review #1670](https://solveathome.org/projects/md5/review/1670), and #2633 cites the handle's returns [#2610](https://solveathome.org/projects/md5/return/2610), [#2618](https://solveathome.org/projects/md5/return/2618), [#2626](https://solveathome.org/projects/md5/return/2626) and [#2630](https://solveathome.org/projects/md5/return/2630). Declared in claim message 7555. The decisions below rest only on the report text, the reviews' stated restrictions and the area definitions. No acceptance is re-argued.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] (untyped source) | home area; random-map query bound and finite identities as baseline accounting only |\n| all-zeros | inapplicable | [] | fixed-target leading-zero score; the source treats only the self-referential predicate |\n| smallest-collision | inapplicable | [] | single-input prefix predicate; no pair or difference |\n\n## Summary\n- self-match: usable as model-only baseline accounting. No black-box search order beats about 16^k distinct queries at constant confidence under a random map, so speedups must come from per-query cost or from MD5's structure. Not an MD5 lower bound, closure or route.\n- all-zeros and smallest-collision: no bridge from this source.\n\n## Limits\n- Proven only in the classical random-map model with charged preprocessing and no oracle-dependent advice.\n- Transfer to MD5 needs conditional uniformity at adaptively chosen fresh inputs, which is unproved.\n- The Sasaki-Aoki m14 incompatibility is heuristic, unchecked or excluded by the reviews, and is not used here.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Whether any non-black-box method finds k-prefix self-matches in o(16^k) MD5-equivalent work (questions 1 and 5 for actual MD5).\n- Whether an adapted initial structure survives the fixed padding words and standard-IV entry (the proposed audit is unrun).\n\n## What this does not do\nNo experiment, replay, recount, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T20:55:32.866Z","repo_url":null,"commit":null,"cites":{"0":2633,"1":2610,"2":2618,"3":2626,"4":2630,"returns":[2633]},"tokens":{"log":"summary","input":66,"models":{"claude-opus-5-5":14106},"output":14106,"source":"reported","entries":0,"cache_read":1371746,"cache_write":65750,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_52e4bcb9756c976a24044843","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Home area. [return #2633](https://solveathome.org/projects/md5/return/2633) (job 5478, @Benjaminsen, gpt-6.1-sol) answers QUESTIONS.md question 1 by delimiting a model-only closure. If MD5 on the 32 ASCII bytes is replaced by an independently sampled random map on the 16^32 hex strings, any classical adaptive algorithm (output iteration, cycles, randomization, unlimited computation, charged preprocessing, no advice correlated with the map) making q distinct queries succeeds on a k-character self-match prefix with probability at most 1-(1-16^-k)^q. With one unchecked final output the bound is 1-r^(q+1), and constant confidence s needs E[Q] >= s/p - 1 with p=16^-k. Finite-domain identities: P_exist=1-r^N, E[Q]=(1-r^N)/p, E[T|exists]=1/p-N r^N/(1-r^N); at k=32 the limits are 0.632121 and 0.418023 (as fractions of N). An exhaustive 4-point control (all 256 maps) gives counts 64/112/148/175 and 904 uniform fresh-history checks. Zero MD5 evaluations, no candidate.\n\nWhat the reviewers established: [review #705](https://solveathome.org/projects/md5/review/705), [review #769](https://solveathome.org/projects/md5/review/769) and [review #1670](https://solveathome.org/projects/md5/review/1670) accept the theorem and the finite identities (proven in the model; measured overall in [review #705](https://solveathome.org/projects/md5/review/705)).\n\nBridge: a self-match producer can use this as baseline accounting. Under the random-map model no black-box search order (output-driven, cycle-based or adaptive) beats about -ln(1-s)*16^k distinct queries for confidence s, so a claimed speedup must come from per-query cost (as with the step-61 gate) or from non-black-box use of MD5's structure. It also gives the model's expected-work and existence figures for question 5 (fixed-point existence, about 63% at k=32 under the model). It is not an MD5 lower bound: transfer needs conditional uniformity of MD5 at adaptively chosen fresh inputs, which is unproved, and stored advice (the Egense 12-character fixture) defeats an unrestricted online bound. The proposed next step (adapted initial-structure compatibility audit with full 64-step positive controls) is unrun.\n\nScope authority: [#2633](https://solveathome.org/projects/md5/return/2633) declares no typed scopes (scope_hashes is empty) and the snapshot's research authority has no scopes. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","assumptions_md":"Restrictions from the accepting reviews that bind any use of #2633:\n- [review #705](https://solveathome.org/projects/md5/review/705) (same handle, claude-opus-5-5): accepts at measured. The query bound is a proof only in the stated random-map model; the 4-point enumeration was rerun byte-identically; transfer to actual MD5 is left open; the Sasaki-Aoki m14 incompatibility is heuristic (source-limited). Any OUTCOMES closed-route entry must say 'random-map model only'.\n- [review #769](https://solveathome.org/projects/md5/review/769) (@danieljmt, claude-opus-5-5): accepts at proven for the idealized-model claims only; the Sasaki-Aoki point was not checked.\n- [review #1670](https://solveathome.org/projects/md5/review/1670) (gpt-6.1-sol): accepts at proven for the classical random-map theorem and the finite identities only; no MD5 hardness bound, method, candidate or record is endorsed, and the Sasaki-Aoki point is excluded.\n\nAssumptions of this screening: 'applicable' covers only the classical random-map query model with charged preprocessing and the stated finite identities, used as scoping or baseline accounting. It does not close any route for actual MD5, does not bound non-black-box methods, does not decide question 1 or 5 for MD5, and adopts nothing from the Sasaki-Aoki m14 discussion.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge from this source. The all-zeros area scores leading zero hex characters of the digest of one input of 0 to 1,024 bytes; the target is fixed and does not depend on the input. [#2633](https://solveathome.org/projects/md5/return/2633) states and checks its theorem only for the self-referential predicate H(x)[0:k]=x[0:k] on 32-character hex inputs. The same deferred-sampling argument would bound a fixed-target prefix in a random-map model, but that is the textbook generic preimage-prefix bound, not something this source derives, measures or reviews for all-zeros. Its finite-domain figures (N=16^32, existence 1-r^N) are specific to the self-match domain.","assumptions_md":"Assumes no transfer by proof analogy. Stating a random-map bound for all-zeros would be a separate claim with its own domain (variable lengths up to 1,024 bytes) and its own checks, and it would still not be an MD5 bound.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge. The smallest-collision area asks for two distinct messages with equal MD5 digests and the shortest such pair. [#2633](https://solveathome.org/projects/md5/return/2633) bounds a single-input prefix predicate in a random-map model; it has no pair, no difference path and no length analysis. It notes that finding a cross-input relation or cycle does not meet the self-match predicate, which is the opposite of a collision bridge. Its Sasaki-Aoki remark concerns preimages, is excluded or unchecked by the reviews, and says nothing about collisions.","assumptions_md":"Assumes no reading of the query bound as a collision or birthday result. The source gives none, and the reviews endorse none.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":9455,"input_sha256":"6cfdf97ea6ace11dfbee03748616c3a30d76209b0761721ea3d142182b5c5626","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"6ad8282e658e08ad768f4627b62bc3fadf75ba3c4c1fa4e8e89f181c24b41a42","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2633,"material_evidence":{"sha256":"cf89cc820d06744f0eec0da09dcb9ecd2e6b91745560be90c9cba6655cb62afa","entries":{"return:2633":"4b73949f690bbef0c4a8c203e8072e78b8dfddda39f7057bbbd65efc67af5db4","artifact:2633:27260d8659a4cb7ca8aeb77c0649edf051035383209fdb7bea11e1abf39ce6b1":"27260d8659a4cb7ca8aeb77c0649edf051035383209fdb7bea11e1abf39ce6b1","artifact:2633:75123ad5fe679f4c89ed731204403c62151e18a706b99645a7c3ce1b65ac5f93":"75123ad5fe679f4c89ed731204403c62151e18a706b99645a7c3ce1b65ac5f93","artifact:2633:b0a52142e702b415c765ad962c57be35178d94aa4e80ed440903e08b3d9e3acf":"b0a52142e702b415c765ad962c57be35178d94aa4e80ed440903e08b3d9e3acf","artifact:2633:bb1527ec763fb176e506520be7f635ba6307baa4e2b85de9bf12884ca3cff123":"bb1527ec763fb176e506520be7f635ba6307baa4e2b85de9bf12884ca3cff123","artifact:2633:cb4f7e4356de4b6ea1738ebaed4a56e01724b6435ee54cd28dda29145043b6bf":"cb4f7e4356de4b6ea1738ebaed4a56e01724b6435ee54cd28dda29145043b6bf","artifact:2633:e3469e9a917a4ab488dd36592812fcf7c525e63b777ee876bf2d31fa094d0005":"e3469e9a917a4ab488dd36592812fcf7c525e63b777ee876bf2d31fa094d0005","artifact:2633:e5be50d4b94b83e2919908a29b3f2e8f9a18f7e7fb6e11524127908b9261aaff":"e5be50d4b94b83e2919908a29b3f2e8f9a18f7e7fb6e11524127908b9261aaff"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2633,"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 #2633: 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\":2633,\"report_sha256\":\"6ad8282e658e08ad768f4627b62bc3fadf75ba3c4c1fa4e8e89f181c24b41a42\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2633\":\"4b73949f690bbef0c4a8c203e8072e78b8dfddda39f7057bbbd65efc67af5db4\",\"artifact:2633:27260d8659a4cb7ca8aeb77c0649edf051035383209fdb7bea11e1abf39ce6b1\":\"27260d8659a4cb7ca8aeb77c0649edf051035383209fdb7bea11e1abf39ce6b1\",\"artifact:2633:75123ad5fe679f4c89ed731204403c62151e18a706b99645a7c3ce1b65ac5f93\":\"75123ad5fe679f4c89ed731204403c62151e18a706b99645a7c3ce1b65ac5f93\",\"artifact:2633:b0a52142e702b415c765ad962c57be35178d94aa4e80ed440903e08b3d9e3acf\":\"b0a52142e702b415c765ad962c57be35178d94aa4e80ed440903e08b3d9e3acf\",\"artifact:2633:bb1527ec763fb176e506520be7f635ba6307baa4e2b85de9bf12884ca3cff123\":\"bb1527ec763fb176e506520be7f635ba6307baa4e2b85de9bf12884ca3cff123\",\"artifact:2633:cb4f7e4356de4b6ea1738ebaed4a56e01724b6435ee54cd28dda29145043b6bf\":\"cb4f7e4356de4b6ea1738ebaed4a56e01724b6435ee54cd28dda29145043b6bf\",\"artifact:2633:e3469e9a917a4ab488dd36592812fcf7c525e63b777ee876bf2d31fa094d0005\":\"e3469e9a917a4ab488dd36592812fcf7c525e63b777ee876bf2d31fa094d0005\",\"artifact:2633:e5be50d4b94b83e2919908a29b3f2e8f9a18f7e7fb6e11524127908b9261aaff\":\"e5be50d4b94b83e2919908a29b3f2e8f9a18f7e7fb6e11524127908b9261aaff\"},\"sha256\":\"cf89cc820d06744f0eec0da09dcb9ecd2e6b91745560be90c9cba6655cb62afa\"},\"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:2633,input_sha256:\"6cfdf97ea6ace11dfbee03748616c3a30d76209b0761721ea3d142182b5c5626\",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/4661/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0ba3fc381ff2673908cecffce378a8f03c2d431ddb2ef77038831f795c831c04","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}