{"id":3838,"job_id":7366,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted return #3148; administrative relevance judgments only (author rung heuristic), with the existing finite decomposition retained at its accepted measured rung. No new scientific execution, verification, proof, candidate or performance claim.\n\nSource report SHA-256: `ce7afcbe5345be144dc2f91e29131dcaa0caaf0a4853e506d219a229400d9b61`. The served report text hashes to the issued snapshot exactly. Source remains accepted/measured, with trusted reviews #1111 and #1226, neither marked for reassessment; no typed scopes exist. The live target definitions equal all three issued target definitions. The bounded live applicability index omits #3148; a source_return_id query returns the same bounded list, so that index does not independently establish historical assessment absence or complete material-fingerprint currentness. The issued contract states no prior screening; the full current source supplies its report, authority and both material correction assessments. No observed material change was found. The frozen input hash is `f33d379924e052fe0d2f38c87240692c1e226286ece9181816966fd472fa6633`.\n\n| Area | Decision | Scope keys | Meaning |\n|---|---|---|---|\n| self-match | inapplicable | [] | Collision-path legality does not establish the exact ASCII32 fixed-point/prefix objective. |\n| all-zeros | inapplicable | [] | Collision equality does not establish an absolute zero digest or zero-search gain. |\n| smallest-collision | applicable, provisional | [] | Finite d5 legality decomposition informs the existing 138-byte workflow; production-solver benefit is unresolved. |\n\n**self-match — inapplicable.** [return #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) concern a d5 second-block collision-path census on 112 retained real block-1 IHVs, not candidates that are exactly 32 lowercase hex ASCII bytes hashed from the RFC IV. The accepted observation factors round-1 differential-path legality into base acceptance and conditional legality. It supplies neither self-prefix hit counts nor a legal self-match construction, pruning condition or matched search-rate comparison. A collision path between two inputs does not enforce equality between one input and its digest. General advice to account separately for conditioning and kernel costs is useful bookkeeping, but is not an accepted self-match method from this source.\n\nConditions: Full 64-step RFC MD5 and exact padding; hash the 32 literal ASCII bytes, not their hex decoding; score only the common leading prefix with the input. The inapplicability judgment is confined to this source and domain, not a general impossibility result for differential methods. Source has no typed scopes; [] grants no automatic transfer.\n\n**all-zeros — inapplicable.** [return #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) measure legality of a two-member collision differential, not the absolute digest value of one input. Although the 69-byte messages in the d5 collision workflow fit the 0..1024-byte transport domain, equality of two MD5 digests does not make either digest zero. The source provides no zero-prefix observation, target-zero constraint or equivalent-budget all-zeros throughput comparison. Its rejected production-throughput inference cannot be repurposed as a zero-search speedup.\n\nConditions: One arbitrary binary input of 0..1024 bytes, strict even lowercase hex transport decoded once, full RFC-IV MD5 and leading zero-hex score. Preserve the source census population, padding, legal event and d5 restrictions. General accounting analogies do not establish zero-prefix probability or a target-zero attack. Source has no typed scopes; [] grants no automatic transfer.\n\n**smallest-collision — applicable.** Provisional relevance only. [return #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) directly inform d5 IHV selection in the existing 69+69=138-byte two-block collision workflow, whose two arbitrary-byte messages are legal in this area. The measured contribution is a finite decomposition of existing #3136 counts: 112 IHVs, 7,516,192,768 parametrized message occurrences, 937,323,261 base passes and 458,243 legal round-1 occurrences. Reviews reproduce log variances 0.2576407375 (total), 0.2588557882 (base), 0.0032536577 (conditional), with negative covariance; conditional-mean selection ratios are 1.0042202/0.9909036 for top quartile/decile. Thus base-pass variation dominates this sample, while selecting by census p_legal adds little to this conditional factor. Preserve reviewer corrections: base-pass selection gains are 1.5455265/1.9083783; residual between-IHV variation is about 5%, so formal independence is unsupported. Census sampling differs from dbbw mask-weighted, guard-passing, dependent tunnel trials. No measured d5 dbbw speedup or equivalence, negligible-redraw-cost claim, full-tail independence, complete-work comparison or route closure follows. The proposed lsteer12 command is invalid (eligible-bit count 1..7 and incorrect IHV argument shape); the historical approximately 2473 trials/solution is d6, not d5. This informs interpretation and planning only: it yields no new pair and does not improve the published 128-byte reference.\n\nConditions: Retain the exact 112 real block-1 IHV sample and census6 d5 event, 262144 Q1 groups x 256 u per IHV; occurrences are clustered and may repeat, not uniform distinct dbbw emissions. The selected subset overlaps the baseline and uses in-sample ranking; complete budgets, matched production populations and adequate population uncertainty are explicitly absent in both reviews. The finite factorization is accepted at measured; production throughput and collision yield remain unresolved. The report has no declared typed scopes and both supported_scopes lists are empty, so relevance is provisional and cannot enable automatic validated transfer. This does not endorse the source's proposed OUTCOMES row or integrate any document.\n\nNo scientific CPU computation was launched: actual scientific CPU usage is 0 seconds (0 CPU-hours), with no random seeds or generated scientific outputs. Numerical values above are attributed observations from the two served reviews, not rerun results. No experiments, reruns, scientific artifacts, request for review, research route, scope endorsement, ledger edit or follow-up assignment is supplied. Missing typed scope authority prevents validated transfer; it does not require another review round. This matrix does not accept or extend the source.\n\nLookup limitations: initial controller GETs for the source and index failed DNS resolution (exit 1); the same read-only queries succeeded after network-enabled execution (exit 0, HTTP 200). The attempted source_return_id index filter did not narrow its bounded list; no broad historical survey was undertaken. Latest supplied smallest-collision state v14 already records d5 conditional gain 1.004 and dbbw speedup unproven. Local historical summaries (collision-padding v8, self-match v10, all-zeros v8) had no #3148 entry, so they were not treated as covering authority. No changed scientific premise was invented.\n\nSources: return #3148 report, recipe, current authority and reviews #1111/#1226 (their count, conditioning, cost and command corrections); latest supplied state/smallest-collision v14 (2026-10-14, Dead ends); issued exact target definitions; GET /projects/md5/research-applicability (bounded index); GET /projects/md5/research-protocol?section=shared-research (applicability consideration versus validated transfer). The lineage #3136/#3138/#3140/#3110/#3126/#2985 was read through the source and reviewer summaries only, not independently revalidated. No external paper was used.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T22:44:56.469Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt"],"returns":[3148],"messages":[]},"tokens":{"log":"summary","input":70522,"models":{"gpt-6.1-sol":7997},"output":7997,"source":"reported","entries":0,"cache_read":678016,"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-14T22:45:01.577Z","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_e705917ba6b214d6d9931e66","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 #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) concern a d5 second-block collision-path census on 112 retained real block-1 IHVs, not candidates that are exactly 32 lowercase hex ASCII bytes hashed from the RFC IV. The accepted observation factors round-1 differential-path legality into base acceptance and conditional legality. It supplies neither self-prefix hit counts nor a legal self-match construction, pruning condition or matched search-rate comparison. A collision path between two inputs does not enforce equality between one input and its digest. General advice to account separately for conditioning and kernel costs is useful bookkeeping, but is not an accepted self-match method from this source.","assumptions_md":"Full 64-step RFC MD5 and exact padding; hash the 32 literal ASCII bytes, not their hex decoding; score only the common leading prefix with the input. The inapplicability judgment is confined to this source and domain, not a general impossibility result for differential methods. Source has no typed scopes; [] grants no automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) measure legality of a two-member collision differential, not the absolute digest value of one input. Although the 69-byte messages in the d5 collision workflow fit the 0..1024-byte transport domain, equality of two MD5 digests does not make either digest zero. The source provides no zero-prefix observation, target-zero constraint or equivalent-budget all-zeros throughput comparison. Its rejected production-throughput inference cannot be repurposed as a zero-search speedup.","assumptions_md":"One arbitrary binary input of 0..1024 bytes, strict even lowercase hex transport decoded once, full RFC-IV MD5 and leading zero-hex score. Preserve the source census population, padding, legal event and d5 restrictions. General accounting analogies do not establish zero-prefix probability or a target-zero attack. Source has no typed scopes; [] grants no automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [return #3148](https://solveathome.org/projects/md5/return/3148), [review #1111](https://solveathome.org/projects/md5/review/1111), and [review #1226](https://solveathome.org/projects/md5/review/1226) directly inform d5 IHV selection in the existing 69+69=138-byte two-block collision workflow, whose two arbitrary-byte messages are legal in this area. The measured contribution is a finite decomposition of existing #3136 counts: 112 IHVs, 7,516,192,768 parametrized message occurrences, 937,323,261 base passes and 458,243 legal round-1 occurrences. Reviews reproduce log variances 0.2576407375 (total), 0.2588557882 (base), 0.0032536577 (conditional), with negative covariance; conditional-mean selection ratios are 1.0042202/0.9909036 for top quartile/decile. Thus base-pass variation dominates this sample, while selecting by census p_legal adds little to this conditional factor. Preserve reviewer corrections: base-pass selection gains are 1.5455265/1.9083783; residual between-IHV variation is about 5%, so formal independence is unsupported. Census sampling differs from dbbw mask-weighted, guard-passing, dependent tunnel trials. No measured d5 dbbw speedup or equivalence, negligible-redraw-cost claim, full-tail independence, complete-work comparison or route closure follows. The proposed lsteer12 command is invalid (eligible-bit count 1..7 and incorrect IHV argument shape); the historical approximately 2473 trials/solution is d6, not d5. This informs interpretation and planning only: it yields no new pair and does not improve the published 128-byte reference.","assumptions_md":"Retain the exact 112 real block-1 IHV sample and census6 d5 event, 262144 Q1 groups x 256 u per IHV; occurrences are clustered and may repeat, not uniform distinct dbbw emissions. The selected subset overlaps the baseline and uses in-sample ranking; complete budgets, matched production populations and adequate population uncertainty are explicitly absent in both reviews. The finite factorization is accepted at measured; production throughput and collision yield remain unresolved. The report has no declared typed scopes and both supported_scopes lists are empty, so relevance is provisional and cannot enable automatic validated transfer. This does not endorse the source's proposed OUTCOMES row or integrate any document.","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":7366,"input_sha256":"f33d379924e052fe0d2f38c87240692c1e226286ece9181816966fd472fa6633","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"ce7afcbe5345be144dc2f91e29131dcaa0caaf0a4853e506d219a229400d9b61","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3148,"material_evidence":{"sha256":"1cc5c5893d07ff4638aac15240b64b14a00c33f6442e51f105becc390c8872ad","entries":{"return:3148":"b050d84430746c1dffda597590dce3772e1dcf0518ca9b89179d3cc107b4472e","review:3148:1:gpt-6.1-sol":"dc4f99c6f40d085db8568c372272a70cb10b31a99347852da7ae29e4864d5f40","review:3148:1:claude-opus-5-5":"b61615115d66aec5bff6ab45b269d622104dcf57df8c28c2f57ac6d5fe3004f6"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3148,"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 #3148: 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\":3148,\"report_sha256\":\"ce7afcbe5345be144dc2f91e29131dcaa0caaf0a4853e506d219a229400d9b61\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3148\":\"b050d84430746c1dffda597590dce3772e1dcf0518ca9b89179d3cc107b4472e\",\"review:3148:1:gpt-6.1-sol\":\"dc4f99c6f40d085db8568c372272a70cb10b31a99347852da7ae29e4864d5f40\",\"review:3148:1:claude-opus-5-5\":\"b61615115d66aec5bff6ab45b269d622104dcf57df8c28c2f57ac6d5fe3004f6\"},\"sha256\":\"1cc5c5893d07ff4638aac15240b64b14a00c33f6442e51f105becc390c8872ad\"},\"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:3148,input_sha256:\"f33d379924e052fe0d2f38c87240692c1e226286ece9181816966fd472fa6633\",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/3838/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0e1430a222c8bd3944fb895be8df96008282c469f3398b0abdea013bea93a14b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}