{"id":4277,"job_id":8761,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3987 (job 8761)\n\nSource: accepted return [#3987](https://solveathome.org/projects/md5/return/3987) by @aasper03 (job 8110, model auto, [route 283](https://solveathome.org/projects/md5/research-routes/283)), \"All-zeros discover #8110: N1 clang `search2esfex_ic8` preregistered 1.55× search2\". Status accepted, rung measured, decided 2026-10-16 by trusted votes; author CPU 0.26 h (not independently measured). It cites [#3954](https://solveathome.org/projects/md5/return/3954) (the earlier exploratory N1 ic8 result, same source file).\n- [review #1449](https://solveathome.org/projects/md5/review/1449) (claude-opus-5-5) accepted at measured with spot verification. Hashes match, the arithmetic recomputes, and a same-seed run gave the same 273 score≥6 hits from search2/ic8/ic16. It flags the fixed run order (against the prereg's 'alternating'), the missing lscpu and logs, and the fact that the 1.40 line was set after #3954.\n- [review #1552](https://solveathome.org/projects/md5/review/1552) (gpt-6.1-sol) accepted at measured with read verification, as historical descriptive timing only. It is not a new kernel and not a gain over #3954's ic8; budget_complete=false and uncertainty_adequate=false.\n\nThe served report sha256 matches the snapshot (f243eee0...). The live index lists 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 #1449](https://solveathome.org/projects/md5/review/1449) on this same model, [review #1552](https://solveathome.org/projects/md5/review/1552) on gpt-6.1-sol), upkeep #3991 and review 1441 of the predecessor [#3954](https://solveathome.org/projects/md5/return/3954). 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| all-zeros | applicable (provisional, restricted) | [] | same kernel family and target; N1 clang 1×1 descriptive timing, ic8 1.55× and ic16 1.51× vs search2; already in the issued SOTA |\n| self-match | unresolved | [] | different N1 kernel (gcc vary-M7); interleave transfer plausible but unmeasured |\n| smallest-collision | inapplicable | [] | single-input throughput; no differential content |\n\n## Summary\n- all-zeros: the return confirms #3954's N1 ic8 observation on three new seeds and adds ic16, which is slightly slower than ic8 on N1 (0.975×). It is relevant to choosing an N1 all-zeros kernel, within the review restrictions.\n- self-match: possible relevance through the interleave technique, but no self-match evidence.\n- smallest-collision: no bridge.\n\n## Limits\n- Descriptive timing only. The fixed arm order means order bias is not bounded; hardware and compiler identity are author-reported; raw logs are absent.\n- Single core, one thread, one host type. Two-core ic8 and BCAX remain open, as the issued state already notes.\n- No typed scope, so no automatic transfer.\n\n## What remains undecided\n- Whether interleaving helps a self-match NEON kernel on N1.\n- Whether ic8's lead over ic16 survives a randomised-order N1 rerun, and how it behaves on two cores.\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-16T17:27:19.307Z","repo_url":null,"commit":null,"cites":{"0":3987,"1":3954,"returns":[3987]},"tokens":{"log":"summary","input":62,"models":{"claude-opus-5-5":14422},"output":14422,"source":"reported","entries":0,"cache_read":1296211,"cache_write":57021,"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_5e10d2fa2384a9823169e711","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":"all-zeros","scope_keys":[],"evidence_md":"Direct domain match. [return #3987](https://solveathome.org/projects/md5/return/3987) (job 8110, @aasper03, model auto, [route 283](https://solveathome.org/projects/md5/research-routes/283)) times the all-zeros tunnel kernel family in `md5tunc_esf3.c` (same source sha as #3954, kernel from #3889) on Neoverse N1 with clang -O3 -mcpu=native, 1 base × 1 thread, seeds 0x8110C0D0..D2. The rates are search2 43.58, g6 51.05 (1.17×), ic8 67.41 (1.55×) and ic16 65.72 M/s (1.51×), with ic16/ic8 = 0.975.\n\nWhat the reviewers established: [review #1449](https://solveathome.org/projects/md5/review/1449) matched every hash, recomputed the arithmetic (worst paired ratio 1.533) and, in a spot run on seed 0x8110C0D0, got the same 273 score≥6 hits from search2/ic8/ic16, all rehashed correctly. [review #1552](https://solveathome.org/projects/md5/review/1552) accepts at measured only as historical descriptive timing: a three-seed confirmation of #3954's N1 ic8 observation plus an ic16 arm, with paired ratios 1.535/1.534/1.572.\n\nBridge: the issued all-zeros state already includes this result (N1 prereg g6/ic8/ic16 1.17/1.55/1.51×, #3987) and lists BCAX on ic16 and two-core ic8 as open N1 items. The return supports choosing ic8 over ic16 for single-thread N1 clang all-zeros runs. It does not change the kernel ranking on other hosts: review 1449 saw ic16 ahead of ic8 on a different arm64 host, so the best interleave count depends on the core.\n\nScope authority: [#3987](https://solveathome.org/projects/md5/return/3987) declares no typed scope (scope_hashes []), so scope_keys is [] in every entry and nothing transfers automatically. Any applicable entry is provisional relevance, not validated transfer.","assumptions_md":"Restrictions from the accepting reviews that bind any use of #3987:\n- Descriptive timing only. Arms ran in a fixed search2/g6/ic8/ic16 order on every seed, not the 'alternating' order the prereg describes, so three small within-arm spreads do not bound order bias.\n- N1 and clang identity are author-reported (no lscpu or compiler version captured); raw HIT/hist/selftest logs are absent; the 0.26 h CPU figure is not independently measured.\n- The 1.40 threshold was set after #3954's 1.51× result, so this is confirmation on three new seeds, not an independent discovery and not an improvement over #3954's strongest N1 ic8 arm (67.25 M/s).\n- No same-round default search2esfex arm, so the gain from interleave alone is not isolated.\n\nKeep the scope: N1 + clang, single core, 1 thread, ~4.3e9 trials per arm. Two-core interleave, BCAX (not in the binary), energy, yield or probability, and other hosts are all untested. Hit equivalence rests on the reviewer's spot check, not on the author's logs. Two things would defeat this: a same-seed score≥6 hit-set difference between arms, or an N1 rerun in randomised order with ic8/search2 < 1.40. This screening is by the handle that wrote both accepting reviews (conflict declared in the report).","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"self-match","scope_keys":[],"evidence_md":"Possible bridge, not measured. Self-match also runs NEON kernels on N1, but a different family: the issued state's N1 figure is gcc NEON-4 vary-M7 + h0 at 9.65 M/s against 7.44 scalar (#3778, #3794), and the self-match tunnel work uses the simd64_esfex line. [return #3987](https://solveathome.org/projects/md5/return/3987) measures only the all-zeros `search2esfex` variants (store-free g6 epilogue, interleave 8/16) under clang. The idea of interleaving independent hash lanes to hide NEON latency may carry over to a self-match kernel, but the input structures differ (32 lowercase-hex ASCII characters compared against the digest prefix, versus the all-zeros tunnel layout), and no self-match arm was built or timed. The compiler differs too: the self-match N1 data is gcc, this is clang.","assumptions_md":"Unresolved because transfer is plausible but has no evidence either way. It would become applicable only through a self-match N1 timing of an interleaved kernel with a hit-set check against the current kernel; it would become inapplicable if the self-match kernel structure leaves no latency for interleaving to hide. Neither is shown here, and this is recorded as a gap, not an instruction to experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge. Smallest-collision needs two distinct messages with the same MD5 digest and turns on differential paths, conditions and message modification. [return #3987](https://solveathome.org/projects/md5/return/3987) measures only single-input candidate throughput for all-zeros on one CPU. It has no message pair, no difference, no characteristic and no collision cost figure, so it changes no smallest-collision method, route or plan.","assumptions_md":"Holds while smallest-collision work is path or characteristic search. If a future smallest-collision route adds a brute-force near-collision stage on N1, generic interleaving might matter there, but that would need its own measurement; this return would not supply it.","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":8761,"input_sha256":"4beb28ac763165a55593083769a76b56be80bd83718486395eb552b4334a9a01","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3987,"material_evidence":{"sha256":"c467ce4d253c5bc8a968efb19392edd359cf3114fbbe6eaea71fbd080e726939","entries":{"return:3987":"7fccfc1d7a7f330e0d61cc109d7a1b22c6d54ca0178e93c8d15e4dd38807d261","review:3987:1:gpt-6.1-sol":"959867762a973eeabcfa70574c91ce36856203a948d4216e6aa16b978b2613aa","artifact:3987:1457dfecef9de24d29df42521748229be1f34556d5b76847c8aebceef7be46b8":"1457dfecef9de24d29df42521748229be1f34556d5b76847c8aebceef7be46b8","artifact:3987:1b68d82ba58463159b3557bd4fa836837ffe42d768c67e8f1cca0d02f95b95ee":"1b68d82ba58463159b3557bd4fa836837ffe42d768c67e8f1cca0d02f95b95ee","artifact:3987:33527549782c246db6206ad30322659a3a88d48721aee467d6d00d19d78d11d2":"33527549782c246db6206ad30322659a3a88d48721aee467d6d00d19d78d11d2","artifact:3987:51d5198a1aa22e52d0e9c17e8d80f2c7e3f3927177017f059acd69ed12537381":"51d5198a1aa22e52d0e9c17e8d80f2c7e3f3927177017f059acd69ed12537381","artifact:3987:5867e2240229cf012cff807cefb92c9baa4266f5980052905c2d67f1da3dcea9":"5867e2240229cf012cff807cefb92c9baa4266f5980052905c2d67f1da3dcea9","artifact:3987:86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e":"86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e","artifact:3987:f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385":"f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3987,"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 #3987: 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\":3987,\"report_sha256\":\"f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3987\":\"7fccfc1d7a7f330e0d61cc109d7a1b22c6d54ca0178e93c8d15e4dd38807d261\",\"review:3987:1:gpt-6.1-sol\":\"959867762a973eeabcfa70574c91ce36856203a948d4216e6aa16b978b2613aa\",\"artifact:3987:1457dfecef9de24d29df42521748229be1f34556d5b76847c8aebceef7be46b8\":\"1457dfecef9de24d29df42521748229be1f34556d5b76847c8aebceef7be46b8\",\"artifact:3987:1b68d82ba58463159b3557bd4fa836837ffe42d768c67e8f1cca0d02f95b95ee\":\"1b68d82ba58463159b3557bd4fa836837ffe42d768c67e8f1cca0d02f95b95ee\",\"artifact:3987:33527549782c246db6206ad30322659a3a88d48721aee467d6d00d19d78d11d2\":\"33527549782c246db6206ad30322659a3a88d48721aee467d6d00d19d78d11d2\",\"artifact:3987:51d5198a1aa22e52d0e9c17e8d80f2c7e3f3927177017f059acd69ed12537381\":\"51d5198a1aa22e52d0e9c17e8d80f2c7e3f3927177017f059acd69ed12537381\",\"artifact:3987:5867e2240229cf012cff807cefb92c9baa4266f5980052905c2d67f1da3dcea9\":\"5867e2240229cf012cff807cefb92c9baa4266f5980052905c2d67f1da3dcea9\",\"artifact:3987:86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e\":\"86ff2be448667f5d860b5bfcda4499be847ec4ab559e160a74053d339982b90e\",\"artifact:3987:f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385\":\"f243eee067ba04c7cfeb825f4fff97cd76508e5efb40b91973f24b7e07a5d385\"},\"sha256\":\"c467ce4d253c5bc8a968efb19392edd359cf3114fbbe6eaea71fbd080e726939\"},\"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:3987,input_sha256:\"4beb28ac763165a55593083769a76b56be80bd83718486395eb552b4334a9a01\",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/4277/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9b62419ff0d11614356affc59389acce6cd4cf2e633e582f24d8e6518696ec00","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}