{"id":3502,"job_id":7220,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3268 (job 7220)\nSource: accepted return #3268 (explore, job 6853, lane 34), final rung measured, \"All-zeros: random 2-bit step-4 filters also null vs A-byte0 (follows #3257)\". The served report sha256 matches the snapshot. The source declares no typed scopes and the index listed it with no prior assessment. Disclosure: #3268 was authored under this department's handle aasper03, the same handle submitting this screening; I judged it only from its files, reviews #1120 and #1139, and finding 99528. No experiment was run.\n\n| area | decision |\n|---|---|\n| self-match | inapplicable |\n| all-zeros | applicable (provisional, scope_keys []) |\n| smallest-collision | inapplicable |\n\n## Summary\n#3268 is a finite negative screen: 200 seeded random two-bit conditions (both bits 1) on the MD5 state after four completed updates, tested for enrichment of digest byte 0 = 0 over 3e6 random 52-byte messages against a 20-shuffle permutation null. The observed maximum (1.044569) sits at the null mean (1.045442). Review #1120 reproduced every value exactly with an independent port; review #1139 accepted at measured but restricted the claim to this fixed screen, and open finding 99528 asks to replace \"not a lever\"/\"closed\" wording with that narrow statement. A-byte0 = 0 is the all-zeros score >= 2 event in-domain (full MD5, valid lengths), so the result is usable provisional negative evidence for all-zeros, restricted as above. Self-match uses 32-byte ASCII-hex candidates with an input-dependent target, and smallest-collision needs full-digest equality between two inputs; neither is touched.\n\n## What this does not do\nNo experiment, recomputation, new claim, artifact, review request or route change. Every entry is provisional (scope_keys []) and none is a validated transfer. The all-zeros entry inherits the #1139 / finding 99528 narrowing: it does not close two-bit conditions in general, nor other signs, steps, lengths, seeds, algebraic or Q9-constrained conditions, or full-A targets, and it does not endorse portable C correctness or the reported CPU cost. The only gap recorded is the missing typed scope authority.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T13:40:27.755Z","repo_url":null,"commit":null,"cites":{"returns":[3268]},"tokens":{"log":"summary","input":72,"models":{"claude-opus-5-5":15887},"output":15887,"source":"reported","entries":0,"cache_read":1502438,"cache_write":56545,"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_2783a730c204ca61fbdb5ff2","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":"Mismatch. The self-match area hashes exactly 32 ASCII hex bytes (single block with 0x80 at byte 32 and bit length 256) and scores the prefix agreement between the candidate and its own digest, so the target depends on the input. #3268 samples arbitrary random 52-byte messages (bit length 416) against a fixed target, digest byte 0 = 0. Neither its input distribution, its padding nor its target transfers, and a fixed-byte null says nothing about candidate-dependent prefix matching. Two-bit conditions for self-match remain a separate open scope; single-bit self-match screens are separate returns and are not touched here.","assumptions_md":"Provisional relevance only: #3268 declares no typed research_evidence scopes (research_authority.scopes = []), so scope_keys is [] and nothing here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured by trusted reviews #1120 (exact independent Node rerun) and #1139 (read), restricted per #1139 and open finding 99528: no detected both-bits-1 enrichment of A-byte0 = 0 among 200 seeded random two-bit conditions on the state after four completed step updates (before zero-based M4 use), in one fixed screen - N = 3,000,000 random 52-byte single-block messages, seed 0x6853c0de, permutation null R = 20 (obs max 1.044569 vs null mean 1.045442, p95 1.060001). Per #1120 only joint enrichments of roughly 6% or more were detectable; coverage is at most 200 of 8128 unordered pairs and one of four sign patterns; R = 20 makes the p95 coarse. Not carried: any 'not a lever' or route-closed wording, other signs, lengths, seeds, steps, algebraically chosen or Q9-constrained conditions, full-A or full-digest targets, portable C correctness (#1139: signed-shift UB, little-endian assumption) and the 0.03 CPU-hour cost (timer covers generation only).","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Bridge, provisional. The all-zeros score counts leading zero hex characters of the digest; A-byte0 = 0 is exactly the event that the first two hex characters are 0, i.e. score >= 2. #3268 runs full 64-step MD5 with the RFC 1321 IV, exact single-block padding (M13 = 0x80 at byte 52, M14 = 416, M15 = 0, checked by #1120 and #1139), and its 52-byte inputs lie inside the 0..1024-byte domain. Usable existing evidence is a negative (restricted) result for one filter family on the way to a zero prefix: random both-bits-1 two-bit conditions on the step-4 state did not enrich A-byte0 = 0 beyond a permutation null at N = 3e6 (p_byte0 0.00392033, n 11761), with the detection limit of roughly 6% per #1120. It closes only that tested method in that fixed screen. It is not a closed route for all-zeros and states no lever, record or end-to-end advantage; finding 99528's narrowing is carried as the scope.","assumptions_md":"Provisional relevance only: #3268 declares no typed research_evidence scopes (research_authority.scopes = []), so scope_keys is [] and nothing here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured by trusted reviews #1120 (exact independent Node rerun) and #1139 (read), restricted per #1139 and open finding 99528: no detected both-bits-1 enrichment of A-byte0 = 0 among 200 seeded random two-bit conditions on the state after four completed step updates (before zero-based M4 use), in one fixed screen - N = 3,000,000 random 52-byte single-block messages, seed 0x6853c0de, permutation null R = 20 (obs max 1.044569 vs null mean 1.045442, p95 1.060001). Per #1120 only joint enrichments of roughly 6% or more were detectable; coverage is at most 200 of 8128 unordered pairs and one of four sign patterns; R = 20 makes the p95 coarse. Not carried: any 'not a lever' or route-closed wording, other signs, lengths, seeds, steps, algebraically chosen or Q9-constrained conditions, full-A or full-digest targets, portable C correctness (#1139: signed-shift UB, little-endian assumption) and the 0.03 CPU-hour cost (timer covers generation only).","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Mismatch. The area needs two distinct inputs with equal full 128-bit digests. #3268 studies a single-message event (digest byte 0 = 0) under random sampling; it has no message pair, no input difference, no differential path or condition set for one, and no near-collision measure. A null for byte-0 enrichment in one message does not bear on collision search.","assumptions_md":"Provisional relevance only: #3268 declares no typed research_evidence scopes (research_authority.scopes = []), so scope_keys is [] and nothing here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted at measured by trusted reviews #1120 (exact independent Node rerun) and #1139 (read), restricted per #1139 and open finding 99528: no detected both-bits-1 enrichment of A-byte0 = 0 among 200 seeded random two-bit conditions on the state after four completed step updates (before zero-based M4 use), in one fixed screen - N = 3,000,000 random 52-byte single-block messages, seed 0x6853c0de, permutation null R = 20 (obs max 1.044569 vs null mean 1.045442, p95 1.060001). Per #1120 only joint enrichments of roughly 6% or more were detectable; coverage is at most 200 of 8128 unordered pairs and one of four sign patterns; R = 20 makes the p95 coarse. Not carried: any 'not a lever' or route-closed wording, other signs, lengths, seeds, steps, algebraically chosen or Q9-constrained conditions, full-A or full-digest targets, portable C correctness (#1139: signed-shift UB, little-endian assumption) and the 0.03 CPU-hour cost (timer covers generation only).","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":7220,"input_sha256":"5cc640cca35928de7a5d539f12c5ab847e4522bb10475e0aa8731a5683730698","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3268,"material_evidence":{"sha256":"a3bf9718637c6576a9088c05ede51b03651d97d81575b1182a1eea85be62f4d6","entries":{"return:3268":"0d8d77bdf6f4de7adae6e726712a0f41d6a1a7e39cc122122b8b0e47cbeab48a","finding:99528":"ae7ac593d6b2d7b52385a40651d25118465434c229287d8f034249d0643159c4","artifact:3268:5e72218d3164881e3e724866b48ab243f2c95305981cb310c438ece42ddae755":"5e72218d3164881e3e724866b48ab243f2c95305981cb310c438ece42ddae755","artifact:3268:66fbbd5f85bd23918ffce34d180ef3bda7dc45f9eb02343c4c77a0174666656c":"66fbbd5f85bd23918ffce34d180ef3bda7dc45f9eb02343c4c77a0174666656c","artifact:3268:6ebd9f7602618608f008e5c806c0d8a75363fa3e3faafe78b0f066f57ba7f871":"6ebd9f7602618608f008e5c806c0d8a75363fa3e3faafe78b0f066f57ba7f871","artifact:3268:7187cc7f582562898e7c8202055daf6044b08a89428723b860fe646767927bd7":"7187cc7f582562898e7c8202055daf6044b08a89428723b860fe646767927bd7","artifact:3268:7ffe2f4920253f844f9feca347329aff636f96051ece54a4adb0ed9042470c87":"7ffe2f4920253f844f9feca347329aff636f96051ece54a4adb0ed9042470c87","artifact:3268:860fa46bf05a85db18b92d08a90b2dc359e2c4368cd95164070d798b94b838c8":"860fa46bf05a85db18b92d08a90b2dc359e2c4368cd95164070d798b94b838c8","artifact:3268:875e6188f736dd5e371dc2840de670e0d9eb5cc8e90be088b6b24640f8f38b85":"875e6188f736dd5e371dc2840de670e0d9eb5cc8e90be088b6b24640f8f38b85","artifact:3268:f1dc22ef79c0bb4a85bcca937943b43ce521831b426e41505421bc29de31af32":"f1dc22ef79c0bb4a85bcca937943b43ce521831b426e41505421bc29de31af32","artifact:3268:f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2":"f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3268,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T13:40:27.755Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3268: 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\":3268,\"report_sha256\":\"f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3268\":\"0d8d77bdf6f4de7adae6e726712a0f41d6a1a7e39cc122122b8b0e47cbeab48a\",\"finding:99528\":\"ae7ac593d6b2d7b52385a40651d25118465434c229287d8f034249d0643159c4\",\"artifact:3268:5e72218d3164881e3e724866b48ab243f2c95305981cb310c438ece42ddae755\":\"5e72218d3164881e3e724866b48ab243f2c95305981cb310c438ece42ddae755\",\"artifact:3268:66fbbd5f85bd23918ffce34d180ef3bda7dc45f9eb02343c4c77a0174666656c\":\"66fbbd5f85bd23918ffce34d180ef3bda7dc45f9eb02343c4c77a0174666656c\",\"artifact:3268:6ebd9f7602618608f008e5c806c0d8a75363fa3e3faafe78b0f066f57ba7f871\":\"6ebd9f7602618608f008e5c806c0d8a75363fa3e3faafe78b0f066f57ba7f871\",\"artifact:3268:7187cc7f582562898e7c8202055daf6044b08a89428723b860fe646767927bd7\":\"7187cc7f582562898e7c8202055daf6044b08a89428723b860fe646767927bd7\",\"artifact:3268:7ffe2f4920253f844f9feca347329aff636f96051ece54a4adb0ed9042470c87\":\"7ffe2f4920253f844f9feca347329aff636f96051ece54a4adb0ed9042470c87\",\"artifact:3268:860fa46bf05a85db18b92d08a90b2dc359e2c4368cd95164070d798b94b838c8\":\"860fa46bf05a85db18b92d08a90b2dc359e2c4368cd95164070d798b94b838c8\",\"artifact:3268:875e6188f736dd5e371dc2840de670e0d9eb5cc8e90be088b6b24640f8f38b85\":\"875e6188f736dd5e371dc2840de670e0d9eb5cc8e90be088b6b24640f8f38b85\",\"artifact:3268:f1dc22ef79c0bb4a85bcca937943b43ce521831b426e41505421bc29de31af32\":\"f1dc22ef79c0bb4a85bcca937943b43ce521831b426e41505421bc29de31af32\",\"artifact:3268:f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2\":\"f260cd11258f9fc8ec3f4dba9559dca6a09fb7825933fa01556a084dff2ab9c2\"},\"sha256\":\"a3bf9718637c6576a9088c05ede51b03651d97d81575b1182a1eea85be62f4d6\"},\"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:3268,input_sha256:\"5cc640cca35928de7a5d539f12c5ab847e4522bb10475e0aa8731a5683730698\",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/3502/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"bad98181ea553b62527921e0fe6289c491cd771880e2cfd233b5e6ab93627337","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}