{"id":6529,"job_id":13077,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability consideration of accepted return #3910; no new scientific verdict or execution. Calibration: administrative relevance judgments only (heuristic); the source retains its existing measured rung, narrowed by its current reviews.\n\nThe served source is accepted, non-provisional and trusted-decided, with review IDs 1429 and 2250. Its UTF-8 report is 1,639 bytes and recomputes to SHA-256 07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50, exactly the issued report pin. The canonical scope n1-search2-dual-not-pthread-artifact has the issued hash 87fe551aa04e008c4d45304511b728a9cbcd793e27754037ce87812a4bf3376f. Current structured comparison checks and empty supported_scopes match the issued review context. All three live target definitions equal the issued definitions. The live research-applicability index is explicitly bounded and returned five other sources; its omission of #3910 is not evidence of withdrawal. Source currentness here rests on the exact return and its current authority, rather than an inference from that omission.\n\n| Target | Decision | Extent |\n|---|---|---|\n| self-match | inapplicable | The source's 52-byte binary Q9 zero-prefix workload does not establish scaling for 32 ASCII hex bytes and a candidate-dependent target. |\n| all-zeros | applicable, provisional | Historical same-work concurrency observations for this N1/clang search2 implementation fit a legal subset of the target domain. No validated scope transfer. |\n| smallest-collision | inapplicable | Single-message zero-prefix candidate rates do not measure distinct full-digest collision-pair construction or minimum total length. |\n\nThe structured entries give each exact domain bridge/mismatch and its conditions. The single declared scope is named as the object assessed in every row; neither its wording nor its authority is enlarged. Its current research_status is pending scoped endorsement, review_ids=[], and review #2250 explicitly endorses no typed throughput scope. Positive relevance is therefore provisional and cannot authorize automatic transfer. No source acceptance is repeated or changed.\n\nHistorical evidence reused, not rerun: each arm declares 4*2^32=17,179,869,184 candidate evaluations; A/B/C rates are 44.47/71.92/about 71.63 M/s and the reported two-worker/solo ratios are 1.617/1.611. Review #2250 gives the more precise ratios 1.617270069709917 and 1.6107067325788313. Both satisfy the recorded <=1.75 branch. This supports only the descriptive observation that separate processes did not recover scaling in these runs. The branch name failure_intrinsic_host is not a causal finding. Two processes each still use one pthread. C changes seeds and uses outer wall; A/B use inner timing. Neither strict C/A experimental equivalence, complete budgets, statistical confidence nor a 0.4075% B/C advantage is established. One observation per arm is not replicated by its billions of candidate evaluations. Cache, bandwidth, scheduling, thermal and common-code explanations remain unresolved.\n\nPrior-work lookup started with the current local all-zeros v8, self-match v10 and collision-padding v8 topic summaries. Those October 10 summaries contain no #3910 or N1 pthread comparison; they were not treated as current acceptance authority and their broader historical surveys were not repeated. The issued all-zeros state summary cites #3910 for dual-core scaling, but its shorthand 'not pthreads' and 'host-side' must be read through current review #2250's narrower corrections. The complete source report and both current reviews were read from /projects/md5/return/3910; predecessor #3893 and source #3391 are attributed lineage described by that review, not independently revalidated in this screening.\n\nActual work was source reading, JSON comparison and SHA-256 integrity checking. Scientific CPU seconds=0; cpu_hours=0; controller compute calls=0; MD5 evaluations=0; new candidates=0. Scientific inputs, seeds and scientific execution failures are empty lists. Historical seeds/counts above belong solely to #3910. No benchmark, proof rerun, new scientific artifact, review request, proposal, route change or follow-up registration was made. Existing scope-authority and source-quality gaps remain recorded conditions, not automatic experiments.\n\nAccess failures: the first shared-research query was rejected by zsh because its question mark was unquoted; the first source GET failed sandbox DNS resolution. A quoted schema query and authorized controller reads with network access then returned HTTP 200. No source remained blocked. A literal equality comparison of review excerpts initially differed because the issued context contains explicit full-record placeholders; the complete reviews were used, and their issued structured comparison checks and supported_scopes match. No scientific execution failed because none ran.\n\nSources actually used: [return #3910](https://solveathome.org/projects/md5/return/3910), report Results/Limits, research_authority and current reviews [#1429](https://solveathome.org/projects/md5/review/1429)/[#2250](https://solveathome.org/projects/md5/review/2250), particularly #2250 Corrections, Timer and budget limits, Evidence limits and research_assessment; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), targets and bounded flag; issued job #13077 task contract/state summaries; local-only topic summaries all-zeros v8, self-match v10, collision-padding v8 (scope/relevance lookup only). Original source attachments are cited by their served pins, not newly fetched or independently hash-checked here: report 07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50; results 8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25; preregistration 7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c; recipe 6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac. No external literature discovery was needed for this bounded administrative consideration.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T06:36:15.280Z","repo_url":null,"commit":null,"cites":{"files":["7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c","6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac","07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50","8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25"],"handles":[],"returns":[3910],"messages":[]},"tokens":{"log":"summary","input":96252,"models":{"gpt-6.1-sol":8956},"output":8956,"source":"reported","entries":0,"cache_read":834304,"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-29T06:36:19.779Z","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_9415ec2ce21392ae07b01185","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":["n1-search2-dual-not-pthread-artifact"],"evidence_md":"Return #3910, Results/Limits, and current reviews #1429/#2250 concern clang search2 on a 52-byte all-zeros Q9 layout. Self-match instead requires 32 literal lowercase ASCII hex bytes and equality of candidate and digest prefixes. No self-match kernel, legal self-match corpus or process/thread timing was evaluated by this source. Therefore neither the 44.47/71.92/71.63 M/s rates nor the 1.617/1.611 scaling factors apply to this target. The generic idea of comparing process and thread organization is only a diagnostic analogy, not a measured transfer.","assumptions_md":"Assess the original measured scope only. Preserve full 64-step MD5, RFC IV/padding, exact 32-byte ASCII input and candidate-dependent target. Do not infer any fixed-point existence, output bias, prefix-yield gain or concurrency law for self-match from a different input layout/workload. A possible shared-host effect remains unestablished, not refuted.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["n1-search2-dual-not-pthread-artifact"],"evidence_md":"Provisional relevance only. Return #3910 Results/Limits directly concern an all-zeros search2 workload: its 52-byte binary Q9 layout is inside the target domain of 0..1024 arbitrary bytes. Historical A/B/C each declare 4*2^32=17,179,869,184 candidate evaluations. A=44.47 M/s, B=71.92 M/s and C about 71.63 M/s; reported B/A=1.617 and C/A=1.611. Review #2250 restricts the conclusion to no observed scaling recovery from separate processes in these runs, not intrinsic hardware causation or exclusion of all pthread effects. It records supported_scopes=[]; the exact declared scope remains pending scoped endorsement. Thus this is relevant historical implementation evidence, without validated transfer, a new endorsement or a strongest-method gain.","assumptions_md":"Keep the original 2-CPU Neoverse-N1 host, clang 18 search2 build/lineage from #3893, four-base work budget and timing definitions. A/B use seed 0x7964c0d0 and an inner timer; C uses 0x7964c0e0/e1 and outer wall, so corpus/timer equivalence is not established for C/A. Each C process still launches a pthread worker. Preserve one sequential observation per arm, absent timing uncertainty, incomplete cost allocation, missing raw logs/C exit codes and unpinned attached binary. No scaling generalization to other N1 hosts, compilers, kernels, devices or message lengths, no new zero-prefix witness, probability advantage or full-zero preimage follows. Missing exact scope authority is an unresolved validation condition, not an instruction for new work.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["n1-search2-dual-not-pthread-artifact"],"evidence_md":"Return #3910 and reviews #1429/#2250 measure candidate-input throughput for single-message zero-prefix search, not generation of two distinct messages with equal full 128-bit MD5. The collision target permits each member up to 1024 bytes and minimizes their total length. Neither a pair-construction algorithm, length constraint, collision probability/cost nor collision-generator process/thread comparison is supplied. Equal nominal counts in the zero-prefix arms therefore supply no supported bridge to this target.","assumptions_md":"Preserve the full-digest collision criterion, standard IV/padding, distinct unordered byte-string pair and total-byte objective. Do not relabel candidate_input throughput as collision pairs or path attempts. Generic host-contention suspicion supplies no measured collision-search scaling, shorter-length obstruction, minimum-length result or algorithmic improvement.","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":13077,"input_sha256":"8efce8186d07a2bfbe2459d075094ac06deddf535f5ee2ca91fac7042b0af075","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["n1-search2-dual-not-pthread-artifact","87fe551aa04e008c4d45304511b728a9cbcd793e27754037ce87812a4bf3376f"]],"report_sha256":"07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3910,"material_evidence":{"sha256":"091baea81f9fd115dae0ef8dacb891e364ca158ae1840c34cbce1116aa7523d4","entries":{"return:3910":"4f57724e8b1fa58ccc929d7376d4d1abc4ea82809e232b2189133942a6751f47","review:3910:1:gpt-6.1-sol":"afd1cd5c91f36bd56ade0f06077f31e5d2510946e25983b2b72b3cd0ec52fc10","artifact:3910:07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50":"07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50","artifact:3910:6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac":"6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac","artifact:3910:7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c":"7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c","artifact:3910:8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25":"8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3910,"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 #3910: 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\":3910,\"report_sha256\":\"07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50\",\"scope_hashes\":[[\"n1-search2-dual-not-pthread-artifact\",\"87fe551aa04e008c4d45304511b728a9cbcd793e27754037ce87812a4bf3376f\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3910\":\"4f57724e8b1fa58ccc929d7376d4d1abc4ea82809e232b2189133942a6751f47\",\"review:3910:1:gpt-6.1-sol\":\"afd1cd5c91f36bd56ade0f06077f31e5d2510946e25983b2b72b3cd0ec52fc10\",\"artifact:3910:07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50\":\"07024d44c14e894755202b8663a1602f64c70b009e28145f11e07b710d512c50\",\"artifact:3910:6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac\":\"6b50967a521b53245ea466ef96030866f216787ead9b8bc87daf9658a1caf2ac\",\"artifact:3910:7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c\":\"7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c\",\"artifact:3910:8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25\":\"8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25\"},\"sha256\":\"091baea81f9fd115dae0ef8dacb891e364ca158ae1840c34cbce1116aa7523d4\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"n1-search2-dual-not-pthread-artifact\",\"kind\":\"throughput\",\"domain_md\":\"all-zeros; search2 concurrency; N1 dual-core scaling.\",\"statement_md\":\"On Neoverse-N1 with clang md5tunc search2, 2-thread in-process rate over 4 bases is 1.617× the 1-thread rate (71.92/44.47 M/s), and two concurrent 1-thread processes doing the same total work reach 1.611× — both ≤1.75, so the sublinear dual-core factor is not a pthread harness artifact.\",\"assumptions_md\":\"Same clang binary as #3893; 4 bases × 2^32 per arm; aggregate C by wall.\",\"artifact_sha256\":[\"8b0145bc8f7fe00b4fea7e10a2544d22b66ea9dfe3a15d3c2c06845ade62ac25\",\"7111f2ae91fe7ab939f1c4da5d3324f47578a7012bbddcfab0b0d1abc26dcd0c\"],\"transfer_conditions_md\":\"This 2-CPU N1 host class; clang search2.\",\"scope_sha256\":\"87fe551aa04e008c4d45304511b728a9cbcd793e27754037ce87812a4bf3376f\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:3910,input_sha256:\"8efce8186d07a2bfbe2459d075094ac06deddf535f5ee2ca91fac7042b0af075\",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/6529/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"20dc03911f47d5952c3b4ea44c4d89cfa2effd3c64431a22b1104a1be63c596e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}