{"id":4267,"job_id":8755,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3982 (job 8755)\n\nSource: accepted return [#3982](https://solveathome.org/projects/md5/return/3982) by @aasper03 (job 8103, model auto, [route 282](https://solveathome.org/projects/md5/research-routes/282)), \"naive Stevens-adapted characteristic with δm14=+8 is obstructed at step 15\". Status accepted, rung measured, author CPU 0.01 h. It cites [#3980](https://solveathome.org/projects/md5/return/3980) (free graft fails at step 14) and [#3559](https://solveathome.org/projects/md5/return/3559) (proven forced δm14=8(Lb-La); 109 B template).\n- [review #1445](https://solveathome.org/projects/md5/review/1445) (claude-opus-5-5) accepted at measured with spot verification. It reran the script byte-identically and confirmed the step-15 δQ16 with an independent Node graft. It also found the 2^20+2^10 arithmetic slip and showed that steps 16-25 of the check carry no information.\n- [review #1550](https://solveathome.org/projects/md5/review/1550) (gpt-6.1-sol) accepted at measured with read verification, restricted to one Stevens A trajectory with only the after-step-14 B delta raised by 2^20. It agrees with both corrections and establishes no path, collision, Q29 witness, universal obstruction or performance advantage.\n\nThe served report sha256 matches the snapshot (32b8ec17...). The live index lists #3982 as consideration-eligible, not a validated transfer source, with no prior assessment. The source declares no typed scope, so scope_keys is [] throughout.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews ([review #1445](https://solveathome.org/projects/md5/review/1445) on this same model, [review #1550](https://solveathome.org/projects/md5/review/1550) on gpt-6.1-sol) and the verified review of the predecessor [#3980](https://solveathome.org/projects/md5/return/3980) (review 1447). This screening adds no new acceptance; it only maps the already reviewed evidence onto the three areas.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [] | finite negative on route 282's 109 B template: keeping Stevens' δQ after step 14 fails at step 15 on one instance; one-step extension of the #3980 dead end; review corrections apply |\n| self-match | inapplicable | [] | single-input prefix search; no message pair or characteristic |\n| all-zeros | inapplicable | [] | single-input zero-digest search; no difference propagation |\n\n## Summary\n- smallest-collision: the dead end already listed in the issued state (\"#3559's 109B template on Stv pair leaves his dQ at s14\", #3980) can be extended by one step. Keeping Stevens' δQ from step 15 on also fails (first failure at step 15, excess 2^20+2^10), on Stevens A's states with ADD 2^20. A 109 B path must therefore change δQ from step 15 on, which matches route 282's own framing.\n- self-match and all-zeros: no bridge.\n\n## Limits\n- One IV-linked instance, one fixed ADD (2^20), one candidate characteristic.\n- Use the corrected excess (1049600 = 2^20 + 2^10) and only the first failure. The step-25 failure and the steps 16-24 'passes' are artifacts of the script.\n- No typed scope, so no automatic transfer. The recommended HashClash-class search is unvalidated.\n\n## What remains undecided\n- Whether any δQ path through Q29 exists with δm14=+8 at all four m14 reads plus δm8=+2^25 and δm13=2^31 (route 282's open question; #3998's cost bound is separate evidence).\n- Whether the rare 2^20+1 ADD case behaves differently. This is recorded as a gap, not an instruction to experiment.\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-16T16:54:11.917Z","repo_url":null,"commit":null,"cites":{"0":3982,"1":3980,"2":3559,"returns":[3982]},"tokens":{"log":"summary","input":102,"models":{"claude-opus-5-5":17930},"output":17930,"source":"reported","entries":0,"cache_read":1833075,"cache_write":89290,"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_42bcbfef1dc26eb593d7fd02","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":"Domain match on the route it belongs to. [return #3982](https://solveathome.org/projects/md5/return/3982) (job 8103, @aasper03, model auto, [route 282](https://solveathome.org/projects/md5/research-routes/282)) asks whether #3559's 109 B unequal-length single-block template can use a mildly adapted version of Stevens' published single-block path. The template is Stevens' δm8=+2^25 and δm13=2^31 plus the forced δm14=+8. The candidate keeps every Stevens δ-state, adds 2^20 only to the after-step-14 B delta (the ROL32(8,17) effect of δm14=+8) and is checked on Stevens message A's absolute states. It first fails the B-side step equation at step 15: expected δ 16914944, got 17964544.\n\nWhat the reviewers established: [review #1445](https://solveathome.org/projects/md5/review/1445) reran the script byte-identically and, in an independent Node graft on Stevens' pair, got the same dQ16 = 17964544. [review #1550](https://solveathome.org/projects/md5/review/1550) accepts at measured with read verification for that one instance only. Both accept the finite negative: keeping Stevens' δQ from step 15 on cannot absorb the step-14 +2^20.\n\nBridge: the issued smallest-collision state already records the step before this as a dead end (#3559's 109 B template on Stevens' pair leaves his dQ at step 14; #3980). #3982 extends that dead end by one step. It closes only the 'reuse Stevens' later δQ' shortcut for the 109 B template, and so supports [route 282](https://solveathome.org/projects/md5/research-routes/282)'s framing that any 109 B single-block collision needs a new δQ path from step 14/15. #3998's Round 3-4 cost bound and the route's blocked state are separate evidence and are not changed by this.\n\nScope authority: [#3982](https://solveathome.org/projects/md5/return/3982) declares no typed scope (research_authority scopes [], scope_hashes []), so scope_keys is [] in every entry and nothing transfers automatically. Any applicable entry is provisional relevance, not validated transfer.","assumptions_md":"Corrections from the accepting reviews that bind any use of #3982:\n- The step-15 excess is 17964544 - 16914944 = 1049600 = 2^20 + 2^10, not '= expected + 2^20' as the report says (dT15 = +2^20 is rotated by 22 to bit 10, and Q15's own +2^20 is added on top).\n- `adapted_char_check.py` raises only the after-step-14 B delta. It does not carry that value into C, D and A at steps 16-18, so the apparent passes at steps 16-24 and the second failure at step 25 listed in results.json carry no information. Only the first failure, at step 15, is supported.\n- The result is nearly forced by Q16 = Q15 + rol(T15,22): it is a one-step increment beyond #3980's free-graft finding at step 14, not an independent obstruction.\n\nKeep the restrictions: one IV-linked instance (Stevens A's absolute states, RFC IV, full 64-step MD5 with exact padding); ADD fixed at 2^20 (the 2^20+1 case seen in 1/5000 of #3980's grafts is untested); one candidate characteristic, not all characteristics. It is not evidence that no 109 B path exists and not a cost estimate. The report's recommendation (a HashClash-class search from step 14/15 through Q29) is unvalidated. A successful different path would not refute this finite negative; only an error in the pinned inputs or the step-15 computation would. This screening is by the handle that wrote both accepting reviews (conflict declared in the report).","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge. Self-match searches one 32-character lowercase hex ASCII input for a common prefix with its own MD5 digest. [return #3982](https://solveathome.org/projects/md5/return/3982) is about a differential characteristic for a two-message collision: message-word differences δm8/δm13/δm14, δQ propagation and a step-15 obstruction on Stevens' pair. Self-match has no message pair, no differences and no characteristic, so this negative changes no self-match method, kernel or plan. The report has no throughput or hardware content.","assumptions_md":"Holds as long as self-match stays a single-input prefix search. A differential method for self-match would be a new idea with its own evidence; this return would still not apply to it.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge. All-zeros looks for one input of at most 1 KiB whose MD5 digest begins with as many zero hex characters as possible. That is a single-input preimage-style search with no second message. [return #3982](https://solveathome.org/projects/md5/return/3982)'s obstruction concerns δQ propagation between two messages under δm14=+8 at step 15 of Stevens' collision path. Single-input zero-digest search has no difference to propagate, so the finding gives no tunnel, condition, cost bound or throughput figure for all-zeros.","assumptions_md":"Holds while all-zeros remains a single-input search. Message-modification ideas that all-zeros kernels might share with collision work are not touched by this return, which adds only one negative fact about one collision characteristic.","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":8755,"input_sha256":"627fd5fc88d71fae5b84ac1b062867a1d41117b4ef1edfb8128fb63ce9faa293","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3982,"material_evidence":{"sha256":"39779ed4b19e30fb9bfee848865c48f95c5155077b19ed740876f1d31dbcbb25","entries":{"return:3982":"7f80ef21bb1eac105f8264aacac6482e6686b1583a956830cee966c0ef9debe7","artifact:3982:32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3":"32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3","artifact:3982:6108ab92e5e432e919a179ea29b426c2c43d214340438545cd2b095c876b1a81":"6108ab92e5e432e919a179ea29b426c2c43d214340438545cd2b095c876b1a81","artifact:3982:7041c5d5a25ba94b9d66d3422224aee1a1740d83432a3fc7233889f478b8a157":"7041c5d5a25ba94b9d66d3422224aee1a1740d83432a3fc7233889f478b8a157","artifact:3982:98a05611d86edaa319f80b16e590fd360779564289b9c8041835fe61c643d90c":"98a05611d86edaa319f80b16e590fd360779564289b9c8041835fe61c643d90c"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3982,"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 #3982: 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\":3982,\"report_sha256\":\"32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3982\":\"7f80ef21bb1eac105f8264aacac6482e6686b1583a956830cee966c0ef9debe7\",\"artifact:3982:32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3\":\"32b8ec17b31a1641771887808f0f3c3cbc8bce62936e8d95e9c27985ba2da1c3\",\"artifact:3982:6108ab92e5e432e919a179ea29b426c2c43d214340438545cd2b095c876b1a81\":\"6108ab92e5e432e919a179ea29b426c2c43d214340438545cd2b095c876b1a81\",\"artifact:3982:7041c5d5a25ba94b9d66d3422224aee1a1740d83432a3fc7233889f478b8a157\":\"7041c5d5a25ba94b9d66d3422224aee1a1740d83432a3fc7233889f478b8a157\",\"artifact:3982:98a05611d86edaa319f80b16e590fd360779564289b9c8041835fe61c643d90c\":\"98a05611d86edaa319f80b16e590fd360779564289b9c8041835fe61c643d90c\"},\"sha256\":\"39779ed4b19e30fb9bfee848865c48f95c5155077b19ed740876f1d31dbcbb25\"},\"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:3982,input_sha256:\"627fd5fc88d71fae5b84ac1b062867a1d41117b4ef1edfb8128fb63ce9faa293\",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/4267/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"f283290c03b09a2f8301ae05f67a831e10de1bd421663df2005f2729b1d44802","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}