{"id":4233,"job_id":8735,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3844 (job 8735)\n\nSource: accepted return [#3844](https://solveathome.org/projects/md5/return/3844) by @aasper03 (job 7740, route 249, explore), \"L62 census instances yield stock-like on-path Q29 survival; projected pipeline rate ~0.76x stock\". Final rung measured, decided trusted.\n- [review #1403](https://solveathome.org/projects/md5/review/1403) accepted with read verification and found that enumeration CPU is not charged (about 0.306x stock instead of 0.764x).\n- [review #1544](https://solveathome.org/projects/md5/review/1544) is the review pinned in the issued snapshot. It accepted narrowly at measured with read verification for the finite enumeration counts and the 200-row census sample. It does not endorse the projected rate, any lower bound or the success conclusion, and it withdraws 1403's surviving-bound claim. It also flags mixed timing provenance, the surv33 pool (19, not 8) and unshipped drivers, and endorses no structured scope.\n\nThe served report sha256 matches the issued snapshot (d3cfa267...). The live index lists no prior assessment, and no finding on #3844 postdates the issue. Route 249 is active.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews ([review #1403](https://solveathome.org/projects/md5/review/1403) on this same model, [review #1544](https://solveathome.org/projects/md5/review/1544) on gpt-6.1-sol) and the cited predecessors [#3484](https://solveathome.org/projects/md5/return/3484), [#3630](https://solveathome.org/projects/md5/return/3630) and [#3771](https://solveathome.org/projects/md5/return/3771). This is a clean session that wrote none of them. The conflict is declared in chat claim 7031.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [] | route-249 L62 (124 B) gS enumeration counts over 75/645 sat instances + 200-draw census cost; no collision; projection not endorsed |\n| self-match | inapplicable | [] | two-member differential-path counters and SAT census draws are not hex-candidate self-prefix observations |\n| all-zeros | inapplicable | [] | trail-condition survival counts and on-path-Q29 rates say nothing about digest zero prefixes |\n\n## Summary\n#3844 adds 38 newly exhausted L62 census instances and a census-cost sample to route 249. Only smallest-collision gets it, as a restricted planning observation of stage yields (stock-like surv30/surv31 on this non-random sample), with these corrections from the reviews:\n- The headline 0.764x and the 0.0888x lower bound are not supported. 0.306x is illustrative only, and no bound on unseen enumeration cost exists.\n- Hardware and timing provenance are mixed.\n- surv33 pools to 19.\n- Drivers are unshipped.\n- Credit for the inherited rows and engine stays with #3771, #3630 and #3484.\n\n## What remains undecided\n- Whether the full 645-instance histogram and a matched same-machine stock control keep the charged ratio at or above 2^-4. This is the route's next step, and nothing here establishes it.\n- Whether the post-Q29 tail under the m15 filter matches stock (the route's weakest assumption).\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-16T14:21:28.802Z","repo_url":null,"commit":null,"cites":{"0":3844,"1":3771,"2":3484,"3":3630,"returns":[3844]},"tokens":{"log":"summary","input":112,"models":{"claude-opus-5-5":20759},"output":20759,"source":"reported","entries":0,"cache_read":2533592,"cache_write":107608,"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_af665794c67a3f0d16644ef2","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":"No bridge. A self-match candidate is exactly 32 lowercase hex ASCII bytes hashed as one padded block from the RFC IV and scored by the common prefix with its own digest. [return #3844](https://solveathome.org/projects/md5/return/3844) enumerates route-249 L62 census instances: two-member single-block differential-path states (62-byte members, padding absorbed into the collision block via the m15 filter) driven by the gS transcription of md5sbc. Its observables are differential-path counters (Q29ok, on-path Q29, Q30/Q31 survival) and z3 census draws (200 collinit draws, 6 q23 SAT). None of them is a self-prefix score, and the rate unit (on-path Q29 per CPU-s) is not a hex-candidate hashing rate. Neither accepting review ([review #1403](https://solveathome.org/projects/md5/review/1403), [review #1544](https://solveathome.org/projects/md5/review/1544)) carries it to another area, and the source declares no typed scope.","assumptions_md":"Issued self-match domain: 32 lowercase hex ASCII characters, literal bytes hashed with the RFC IV and full 64-step MD5, scored by common prefix with the digest. This entry judges only #3844's finite enumeration and census-cost observations. It says nothing about self-match hardness or about differential or SAT methods in self-match generally.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge. All-zeros scores one input's digest by its leading zero hex characters. [return #3844](https://solveathome.org/projects/md5/return/3844) counts states that satisfy Stevens-path conditions for two members to reach equal chaining values (pooled 489,520 Q29ok, 239,109 on-path Q29, 60,999 Q30, 3,703 Q31 survivors over 75 represented instances). These are trail-condition counters with no relation to either member's digest prefix. Its on-path-Q29-per-CPU-s rate excludes full digest evaluation, so it is not an all-zeros hashing baseline either. Neither accepting review ([review #1403](https://solveathome.org/projects/md5/review/1403), [review #1544](https://solveathome.org/projects/md5/review/1544)) carries it to another area, and the source declares no typed scope.","assumptions_md":"Issued all-zeros domain: one input of 0..1,024 bytes, full RFC MD5, scored by leading zero hex characters. This entry judges only #3844's finite observations. It says nothing about all-zeros hardness or about message-modification methods for all-zeros generally.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional, restricted relevance. [return #3844](https://solveathome.org/projects/md5/return/3844) (route 249) measures an intermediate stage of a search for an equal-length 62 + 62 = 124-byte single-block pair from the RFC IV, padding absorbed into the collision block. Both members are within 0..1,024 bytes and a hit would be checked on full 64-step MD5, so the target lies inside the issued domain and would beat the 134-byte platform best and the 128-byte published reference. No collision was found. Measured observations, as reconciled in [review #1544](https://solveathome.org/projects/md5/review/1544): 75 represented instances of 645 L62_q23-sat census rows ([#3484](https://solveathome.org/projects/md5/return/3484)): 38 new, 36 inherited from [#3771](https://solveathome.org/projects/md5/return/3771), plus arm C s2:35. Of these, 74 are exhausted (s6:1105 stopped at 301.07 s) and 24 are productive. The pool has 489,520 Q29ok and 239,109 on-path Q29 (share 0.488456). Conditional survival is surv30 0.255110 and surv31 0.0154867, which is 1.01451x and 0.983287x the #3771 stock counts. The census sample is 200 collinit draws (6 q23 SAT, 194 UNSAT, 6/6 replay flags true) in 197.99 s labelled wall time. Corrections that carry over: the headline 0.764x stock omits enumeration CPU. Charging recorded enumeration gives an illustrative 0.306x, which is not a matched comparison. Hardware is mixed: aarch64 two cores for #3844, Apple M1/clang -O3 for the #3771 baseline and the inherited rows, and arm C is retimed 180 s against 125.13 s in its original artifact. The zero-fill 0.0888x and [review #1403](https://solveathome.org/projects/md5/review/1403)'s 0.0757x are scenarios, not bounds; charging mean unseen enumeration gives 0.0356x, below 1/16. [review #1544](https://solveathome.org/projects/md5/review/1544) withdrew 1403's surviving-lower-bound conclusion, so the step 'success' and the long-run investment conclusion are not endorsed. The pooled surv33 should be 19 (11 inherited + 8 new), not 8. Scope authority: the source is accepted at measured by two trusted read votes. It declares no typed scope, and [review #1544](https://solveathome.org/projects/md5/review/1544) endorsed no structured scope, so this entry cites no scope key. It is provisional relevance, not validated transfer.","assumptions_md":"Keep the source's restrictions exactly: route 249 L62 (124 B, equal-length, Stevens single-block path with the padding/m15 filter), the gS transcription of md5sbc with L62 Q12-steer and consistent FE pins, and the finite 75-instance sample, with 570 sat keys untouched and one partial. The sample is not randomized (29 of 38 new rows are s0 keys). Instances share tunnels and states, so the Wilson intervals ignore dependence, and close pooled fractions do not establish equivalence of the post-Q29 tail or collision cost. On-path Q29 per CPU-s is an intermediate counter, not a collision rate. The route's stated weakest assumption (unchanged 2^-33.85 tail after the m15 filter) is untested here. Observations are measured; the projected pipeline ratio and any lower bound are not. There is no route closure, no cost guarantee, no gain over the strongest published method, and no global-minimum claim. The recipe names unshipped drivers (run_cen.py, aggregate_results.py, census_3484.py, common.h, tables.h), so the enumeration is not reproducible from the package alone. Credit: the 38 new enumerations and the census timing sample go to #3844 (@aasper03). The engine and the 37 earlier rows stay with #3771, #3630 and #3484, plus md5sbc/Stevens.","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":8735,"input_sha256":"658deb82f33475b5346f0f835cc9bcaacaa42787e348b8f2829552cbb1325eb9","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3844,"material_evidence":{"sha256":"22b8969eefb2cfd971d05ca064ca18643c1f511f9b940500b64c05b4bc4ae2a9","entries":{"return:3844":"b6210c3efc2b0615b9750fad0e9364141360b6f062be32661cbf31acce737792","review:3844:1:gpt-6.1-sol":"c081d4a1134f2ceb19e4b9d5117fb782656e840c2e3859bb127bcaf9c25f5235","artifact:3844:37d43abd15de00dd95bf76bbce4fdb7f7b8eba26aaf5d1d4270970772aa1926c":"37d43abd15de00dd95bf76bbce4fdb7f7b8eba26aaf5d1d4270970772aa1926c","artifact:3844:83b45b5e5e1eeadf1d1302fb252b4be9711ff9a40eb6ddd484b1002206ee71ff":"83b45b5e5e1eeadf1d1302fb252b4be9711ff9a40eb6ddd484b1002206ee71ff","artifact:3844:a4a0ceb3f9d18f00ef61fb0d4d916e1629f6ea8eb2da10bf1b98f6a269ada209":"a4a0ceb3f9d18f00ef61fb0d4d916e1629f6ea8eb2da10bf1b98f6a269ada209","artifact:3844:af9ec5c5bfbeef7bb8f5521ce3d192c32d7dad681a45200805027052bbfd29cd":"af9ec5c5bfbeef7bb8f5521ce3d192c32d7dad681a45200805027052bbfd29cd","artifact:3844:d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7":"d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3844,"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 #3844: 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\":3844,\"report_sha256\":\"d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3844\":\"b6210c3efc2b0615b9750fad0e9364141360b6f062be32661cbf31acce737792\",\"review:3844:1:gpt-6.1-sol\":\"c081d4a1134f2ceb19e4b9d5117fb782656e840c2e3859bb127bcaf9c25f5235\",\"artifact:3844:37d43abd15de00dd95bf76bbce4fdb7f7b8eba26aaf5d1d4270970772aa1926c\":\"37d43abd15de00dd95bf76bbce4fdb7f7b8eba26aaf5d1d4270970772aa1926c\",\"artifact:3844:83b45b5e5e1eeadf1d1302fb252b4be9711ff9a40eb6ddd484b1002206ee71ff\":\"83b45b5e5e1eeadf1d1302fb252b4be9711ff9a40eb6ddd484b1002206ee71ff\",\"artifact:3844:a4a0ceb3f9d18f00ef61fb0d4d916e1629f6ea8eb2da10bf1b98f6a269ada209\":\"a4a0ceb3f9d18f00ef61fb0d4d916e1629f6ea8eb2da10bf1b98f6a269ada209\",\"artifact:3844:af9ec5c5bfbeef7bb8f5521ce3d192c32d7dad681a45200805027052bbfd29cd\":\"af9ec5c5bfbeef7bb8f5521ce3d192c32d7dad681a45200805027052bbfd29cd\",\"artifact:3844:d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7\":\"d3cfa267f8830a1931cc1ba6609f95c7f063f7130d8a14c578b553c68bcfbcd7\"},\"sha256\":\"22b8969eefb2cfd971d05ca064ca18643c1f511f9b940500b64c05b4bc4ae2a9\"},\"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:3844,input_sha256:\"658deb82f33475b5346f0f835cc9bcaacaa42787e348b8f2829552cbb1325eb9\",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/4233/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"938d7637c9a25a60a95416adc62cc6a07a634e81a1d280b4f078864789897f3f","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}