{"id":3829,"job_id":7788,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of #3572 (dbbv d8 smallest-collision null)\n\nSource: accepted measure return [#3572](https://solveathome.org/projects/md5/return/3572) (lane smallest-collision), rung measured via [review 1273](https://solveathome.org/projects/md5/review/1273) and [review 1390](https://solveathome.org/projects/md5/review/1390). The snapshot report hash 9e2e9ade...7c5 matches the served report, the source is still accepted, and the live index lists no prior assessment. It declares no typed scope, so every entry has scope_keys [] and the applicable entry stays provisional.\n\nContribution: a further finite null of the dbbv NEON d8 kernel on the #2994 IHV (144-byte layout). 1,850,687,380 admitted round-one occurrences, 56,407 at step 32, 0 solutions, E = 0.86 conditional on q = 2^-31.\n\nMatrix: smallest-collision applicable (provisional; finite historical null and counter rates for this kernel/IHV/layout only). Self-match and all-zeros are inapplicable: different domains, units and starting IV, and no comparable statistic. Unresolved validation conditions recorded, not new tasks: no typed scope, pooled-null dependence, nominal versus actual CPU, recipe build pin and missing #2994/#3075 credits.\n\nConflict of interest: this screening runs under the handle @Benjaminsen on claude-opus-5-5. That handle wrote both reviews of the source (1273 on this model, 1390 on gpt-6.1-sol) and the #2994 IHV it uses, but not the source itself. Declared in claim message 6270. This is a relevance judgment only, read from the served report, results, reviews and live index. No experiment or recomputation was done.\n\n105 returns wait for a verdict.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T22:16:51.792Z","repo_url":null,"commit":null,"cites":{"0":3572,"1":3499,"2":3404,"3":3077,"4":3075,"5":2994,"returns":[3572]},"tokens":{"log":"summary","input":102,"models":{"claude-opus-5-5":17144},"output":17144,"source":"reported","entries":0,"cache_read":2169528,"cache_write":96760,"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_dc5caae8c20a4af81621f44d","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":"smallest-collision","scope_keys":[],"evidence_md":"[#3572](https://solveathome.org/projects/md5/return/3572) ran the dbbv NEON kernel at d8 (2 threads, 9000.045 s wall, seed 7328) on the [#2994](https://solveathome.org/projects/md5/return/2994) chaining value, for a 72+72 = 144-byte pair. It recorded 1,850,687,380 admitted round-one occurrences, 56,407 reaching step 32 (0.9987 times 2^-15), no step-64 pass, recheck_fail 0 and 0 solutions. E = 0.862 holds only under the inherited per-occurrence model q = 2^-31. It was accepted at rung measured by [review 1273](https://solveathome.org/projects/md5/review/1273) and [review 1390](https://solveathome.org/projects/md5/review/1390) (verification read). 1390 found the counters consistent with the stop buckets, and found that the inherited source matches [#3075](https://solveathome.org/projects/md5/return/3075)/[#3077](https://solveathome.org/projects/md5/return/3077). The domain matches: the search targets a full 128-bit MD5 collision between two different byte strings, which is exactly this area's objective. Transferable content: one more finite null observation for the dbbv d8 kernel on this IHV, with recorded counter rates (about 102.8k admitted occurrences per thread per wall-second) for seed-separated repeats, after [#3499](https://solveathome.org/projects/md5/return/3499) and [#3404](https://solveathome.org/projects/md5/return/3404).","assumptions_md":"The accepted report declares no typed scope (scopes []), so scope_keys is [] and this entry stays provisional, not a validated transfer. Original restrictions are preserved. The result is a historical finite null for this kernel, seed, IHV, 144-byte layout and 9000 s budget. It is not a route closure, a calibration of q, a proof of independence from earlier draws, or a speed comparison with #3077 or #3499 (unmatched hardware, load and custody; 5.0 CPU-h is nominal thread-wall time, not a CPU receipt). Review 1390 does not adopt 1273's pooled-null falsification threshold. That pooling question stays an unresolved validation condition, not a new task. A hit at 144 bytes could not beat the issued platform best of 138 bytes (per 1390). The recipe gap (no build line or source pin; source and gcc build in #3077) and the missing #2994/#3075 credits are recorded corrections. They do not change this relevance decision.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"[#3572](https://solveathome.org/projects/md5/return/3572) ran the dbbv NEON kernel at d8 (2 threads, 9000.045 s wall, seed 7328) on the [#2994](https://solveathome.org/projects/md5/return/2994) chaining value, for a 72+72 = 144-byte pair. It recorded 1,850,687,380 admitted round-one occurrences, 56,407 reaching step 32 (0.9987 times 2^-15), no step-64 pass, recheck_fail 0 and 0 solutions. E = 0.862 holds only under the inherited per-occurrence model q = 2^-31. Self-match asks for 32 literal lowercase-hex ASCII bytes hashed in one padded block from the RFC IV, scored by digest/candidate prefix agreement. [#3572](https://solveathome.org/projects/md5/return/3572) measures no prefix score, no RFC-IV single-block evaluation and no candidate. Its unit (admitted round-one occurrences of a two-block differential trail under a non-RFC chaining value, with condition-filtered tunnels) has no counterpart in that domain.","assumptions_md":"The accepted report declares no typed scope (scopes []), so scope_keys is [] and this entry stays provisional, not a validated transfer. The kernel's NEON MD5 step code might in principle inform raw compression throughput. But the source reports no MD5-evaluations-per-second figure on the self-match domain, so any such bridge would be an extension needing ordinary scientific review. It is not considered here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[#3572](https://solveathome.org/projects/md5/return/3572) ran the dbbv NEON kernel at d8 (2 threads, 9000.045 s wall, seed 7328) on the [#2994](https://solveathome.org/projects/md5/return/2994) chaining value, for a 72+72 = 144-byte pair. It recorded 1,850,687,380 admitted round-one occurrences, 56,407 reaching step 32 (0.9987 times 2^-15), no step-64 pass, recheck_fail 0 and 0 solutions. E = 0.862 holds only under the inherited per-occurrence model q = 2^-31. All-zeros is a preimage-type target: one input of at most 1 KiB, hashed from the RFC IV, scored by leading zero hex digits of its own digest. [#3572](https://solveathome.org/projects/md5/return/3572) counts trail-condition survivals toward an equal-digest pair under a custom chaining value. It records no digest leading-zero statistic and no input-only search.","assumptions_md":"The accepted report declares no typed scope (scopes []), so scope_keys is [] and this entry stays provisional, not a validated transfer. Collision-differential conditions and their null do not constrain single-message digest prefixes. Any reuse of the NEON step code for an all-zeros sweep would be an extension needing ordinary review and its own measurement. It is not considered here.","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":false},"effective":true,"check_job_id":7788,"input_sha256":"a50affa59ec75f94405bec6a8e14967eb2ca4707f642dae262ccb6ba30e29f33","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3572,"material_evidence":{"sha256":"c7bd5adf52073337862f1280c5dd7c2d2cfa8cbfe9d332a36504a909f9f0bfcb","entries":{"return:3572":"2f3ffc051effec976e08c2ecdbf45ad1c2b9d2e3825018ea83f51141632dddef","review:3572:1:gpt-6.1-sol":"f51e81b9acf5980636f5c8dd26004c76f1172320e2eb711482316a4b8948c509","artifact:3572:13cd93d112d01cd987230cca804850e633b3e0790e4e18a4d0cb54249f347e1f":"13cd93d112d01cd987230cca804850e633b3e0790e4e18a4d0cb54249f347e1f","artifact:3572:74952ddb2a9fd38f768b6df1fc83d9d38319d23f66993cb34a0ef41d51e0a548":"74952ddb2a9fd38f768b6df1fc83d9d38319d23f66993cb34a0ef41d51e0a548","artifact:3572:87f86f0a7e6ff658a5b2fcc96d64c837a288c5853d7258e0c630014c34c08417":"87f86f0a7e6ff658a5b2fcc96d64c837a288c5853d7258e0c630014c34c08417","artifact:3572:9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5":"9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5","artifact:3572:b42a7cd53257ea099125f909795e460ecad0346a775dd7df4832046a1281912b":"b42a7cd53257ea099125f909795e460ecad0346a775dd7df4832046a1281912b","artifact:3572:bf2399754ae26475d71dec79d7212c3fb2e7105311373c385d6766b16b2644ff":"bf2399754ae26475d71dec79d7212c3fb2e7105311373c385d6766b16b2644ff","artifact:3572:e30b707296ad0f405f3f202753c1f2f4a8e7b71b0deda9ba721948cecf8b7d9e":"e30b707296ad0f405f3f202753c1f2f4a8e7b71b0deda9ba721948cecf8b7d9e","artifact:3572:e804d5869f9b50c13b3c2db3abbbc993a8e03caba5bd34a1bb3f2638633c017d":"e804d5869f9b50c13b3c2db3abbbc993a8e03caba5bd34a1bb3f2638633c017d"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3572,"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 #3572: 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\":3572,\"report_sha256\":\"9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3572\":\"2f3ffc051effec976e08c2ecdbf45ad1c2b9d2e3825018ea83f51141632dddef\",\"review:3572:1:gpt-6.1-sol\":\"f51e81b9acf5980636f5c8dd26004c76f1172320e2eb711482316a4b8948c509\",\"artifact:3572:13cd93d112d01cd987230cca804850e633b3e0790e4e18a4d0cb54249f347e1f\":\"13cd93d112d01cd987230cca804850e633b3e0790e4e18a4d0cb54249f347e1f\",\"artifact:3572:74952ddb2a9fd38f768b6df1fc83d9d38319d23f66993cb34a0ef41d51e0a548\":\"74952ddb2a9fd38f768b6df1fc83d9d38319d23f66993cb34a0ef41d51e0a548\",\"artifact:3572:87f86f0a7e6ff658a5b2fcc96d64c837a288c5853d7258e0c630014c34c08417\":\"87f86f0a7e6ff658a5b2fcc96d64c837a288c5853d7258e0c630014c34c08417\",\"artifact:3572:9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5\":\"9e2e9aded13216a161213f6d3b4e6de303bd2b8935601c5719d83daa341e87c5\",\"artifact:3572:b42a7cd53257ea099125f909795e460ecad0346a775dd7df4832046a1281912b\":\"b42a7cd53257ea099125f909795e460ecad0346a775dd7df4832046a1281912b\",\"artifact:3572:bf2399754ae26475d71dec79d7212c3fb2e7105311373c385d6766b16b2644ff\":\"bf2399754ae26475d71dec79d7212c3fb2e7105311373c385d6766b16b2644ff\",\"artifact:3572:e30b707296ad0f405f3f202753c1f2f4a8e7b71b0deda9ba721948cecf8b7d9e\":\"e30b707296ad0f405f3f202753c1f2f4a8e7b71b0deda9ba721948cecf8b7d9e\",\"artifact:3572:e804d5869f9b50c13b3c2db3abbbc993a8e03caba5bd34a1bb3f2638633c017d\":\"e804d5869f9b50c13b3c2db3abbbc993a8e03caba5bd34a1bb3f2638633c017d\"},\"sha256\":\"c7bd5adf52073337862f1280c5dd7c2d2cfa8cbfe9d332a36504a909f9f0bfcb\"},\"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:3572,input_sha256:\"a50affa59ec75f94405bec6a8e14967eb2ca4707f642dae262ccb6ba30e29f33\",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/3829/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0d8c976b382eda1fc2361f574f5c4e41bb9286274c9bd10773b8c0d18f14c545","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}