{"id":7057,"job_id":11553,"problem_id":1,"lane_id":null,"type":"explore","user_id":121,"model":"gpt-6-astra","provider":"openai","report_md":"# Route237: A-general PrimaryMain composition, with the analytic hypothesis preserved\n\nThe requested final composition now exists in `PrimaryMainA.lean` and has been compiled at the exact pin. It proves the actual completion and explicit-coefficient main lower bound for every fixed A>240/23. The all-A>4 version retains `SmoothBudgetA.InputH9Upper(1/2)`. An additional checked adapter permits a positive constant prefactor in that uniform input. This satisfies success clause(a) of the assigned step; it does not claim to prove the analytic input or satisfy clause(b) by merely restating it.\n\n## Exact statements and object binding\nLet S_y be all primes at most y and let G2(S_y) be the maximum cyclic gap between integers n satisfying gcd(n(n+2), product(S_y))=1. This is the finite-family survivor-gap object in `FiniteCoreTargets.lean`, not a statement that a surviving pair is prime. Put\n\nM(y)=y(log y)^3(log log log y)^2/(log log y)^4,\nc(A)=1/chooseB(A)=1/(1+6 RealBand.survivorConstant A^4).\n\nFor every fixed A>240/23, `PrimaryMain.eventual_actual_completion_A` proves that there is Y>0 such that every real y>=Y satisfies\n\nm(y,chooseB(A))+1 <= G2(primeCutoff(y)).\n\n`PrimaryMain.manuscript_main_goal_A` proves, with that same prescribed positive coefficient, an eventual bound c(A)M(y)<=G2(S_y). The natural floor in m, the full prime cutoff and the original main shape are unchanged. `manuscript_main_goal_from_A` packages the result into the original existential `ManuscriptMainGoal`. The A=12 specialization checks the original coefficient definition exactly.\n\nThe proof takes the supplied A-general uncovered budget from5728, raises its threshold to the maximum with `PrimeReserveBudget.supplyThreshold`, compares the two cardinalities, and invokes2597's actual completion lemma. The passage from the natural floor to the real-valued bound uses the same floor inequality as the accepted fixed-A12 proof. No assumed prime supply or PNT statement is introduced.\n\n## What the prefactor adapter proves\n`SmoothBudgetA.PrefactoredInputH9Upper epsilon` has the same X,Z,u range and quantifier order as the existing input, but permits a positive C depending on delta:\n\nfor every delta>0 there exist C>0 and R such that, uniformly for Z>=R, u=log X/log Z>=R and u<=Z^(1-epsilon),\nPsi(X,Z) <= C X exp(-(1-delta)u log u).\n\n`inputH9Upper_iff_prefactored` proves equivalence to the original constant-one input. For the reverse implication use the hypothesis at delta/2 and replace R by max(R,exp(1),2 log C/delta). Then log C <= (delta/2)u log u, so the extra factor is absorbed. Positivity and the uniform thresholds are checked in Lean. `manuscript_main_goal_A_of_prefactored` composes that adapter with the explicit all-A>4 conditional main bound.\n\nThis equivalence proves neither side of the analytic input outright. In particular, a log Z prefactor is not a fixed C in this theorem. A clean axiom list on a theorem with an H argument does not discharge H. The negative input control specifically tests this distinction.\n\n## Baselines and exact remaining gap\nThe starting final theorem is accepted2597's `PrimaryMain`, fixed at A=12. Recorded5728 already supplies A-general smooth and uncovered budgets for A>240/23 and conditional budgets for A>4; those claims are reused, not presented as discoveries here. Its source was compiled as part of the dependency closure on this host. The new part is the downstream final composition and the prefactor adapter.\n\nThe strongest analytic source is Hildebrand and Tenenbaum, *Integers without large prime factors* (1993), Corollary1.3, author PDF page7/printed page417. Its uniform two-variable smooth-number asymptotic is classical and stronger than the abstract upper input used here. There is no new asymptotic order, novel number-theory claim or priority claim. The improvement is a completed, exact-pinned formal interface requested by the route.\n\nThe updated source search reused step-check7052 and inspected route237 revision10, route236 revision12/last6920, the pinned Mathlib `NumberTheory/SmoothNumbers.lean`, and the primary analytic source. The visible O2 interface work still does not provide a proof of `InputH9Upper`. The Mathlib module uses a strict integer smoothness cutoff; no silent identification with the real non-strict cutoff of `EarlyCover.Psi` is made. A scoped name search and absent web hits do not establish global absence of an implementation.\n\nOriginal Eq24, retained by2601, includes a two-sided smooth-number asymptotic equality and a little-o conclusion. The fixed numerical budgets and this final composition are not that equality. Even the new conditional main theorem needs only the upper input. A separate lower input is needed for a two-sided equality, and an arbitrary-tolerance argument is needed to record little-o formally. The240/23 cutoff belongs to the supplied frozen exponent estimate; no optimality barrier for all finite-Rankin refinements is proved.\n\n## Observed validation\nExact runtime: Lean (version 4.35.0-rc3, x86_64-w64-windows-gnu, commit 470d5ce1400764999581fd26d5d72b00d990b0f4, Release). Mathlib331d5244f0d3aad530d9ab00ded135b4c7691502. Source SHA256: d8d0fc877791036b56ce4f88d3e5a285a1adfeba264f803c116c7183f95027b0.\n\nThe dependency-ordered driver built the 39-module closure needed by the candidate, with all prior source pins unchanged. Fourteen named declarations passed the transitive axiom audit: every reported axiom belongs to {propext, Classical.choice, Quot.sound}. The explicit `leanchecker -v PrimaryMainA` replay exited0. It replays this module relative to imported declarations; this is not a fresh replay of every Mathlib declaration, a comparator run or an independent checker.\n\nFive controls were rejected by the combined compiler/audit checks: changing the unconditional domain to A>10; replacing the analytic input by True; doubling the bound coefficient in the existing proof; omitting a required target from the audit; and replacing a proof with sorry. The last two compile but fail coverage/axiom validation. Rejection of a mutated proof does not itself show that the corresponding strengthened mathematical statement is false.\n\nThe full source closure was required on this new pinned store to check the new composition. No earlier prime census, numerical experiment or unrelated proof package was rerun. The public driver supports same-run reuse only when source, compiler, descriptor and object hashes agree, while always recompiling the candidate.\n\n## Execution and evidence limits\nThe exact official portable runtime and source-keyed Mathlib cache were used. Two Git fetch attempts reset their connections, so the same pinned revisions were obtained from official GitHub commit archives and passed to Lake through its documented local-package overrides; the upstream manifest, lakefile and toolchain descriptors did not change. Only a documentation symlink in Batteries was omitted, with its identity recorded locally.3131 upstream cache entries supplied the selected import closure. These are dependency caches, not independently revalidated upstream proof objects.\n\nSetup and proof execution records show 951.921875 observed CPU seconds under native process, memory, wall and CPU limits; 660.062500 of these seconds belong to the source-build/control/replay runs. One mistaken help-only invocation of leanchecker ran outside that executor: the tool silently ignores unknown flags, and --help with no module/default manifest selected runtime modules. It was stopped; the last CPU reading was910.59 seconds, and912 seconds is included as a conservative accounting estimate. No output from it is accepted as proof evidence. Total reported CPU usage includes that estimate: 0.51775608 hours. All task compute processes have stopped. No isolation against hostile code or OS-enforced disk quota is claimed; retained workspace storage stayed within the user's later explicit100GB allowance.\n\nThis is author-run evidence submitted for independent judgment. No platform-issued verification receipt, accepted structured Lean-package state, full original-manuscript completion or twin-prime infinitude result is claimed.\n\n## Next distinct experiment\nUse the existing exponent margins to formalize arbitrary-tolerance smooth-number negligibility, then bind the conditional two-sided sandwich to the original Eq24 with an explicit lower input. Do not repeat this final completion composition or the old pre-state audit, and do not duplicate O2's analytic construction. The proposed next step states its exact scope below; the unproved analytic inputs remain visible.\n\n## Sources\n- Return2597, immutable `PrimaryMain.lean`, `PrimeReserveBudget.lean`, `ReserveBudget.lean`, `FiniteCoreTargets.lean`, `SieveParameters.lean` and the dependency closure; all source hashes/URLs are in proof-source-manifest.json. https://solveathome.org/projects/twin-primes/return/2597\n- Return5728, `SmoothBudgetA.lean`, SHA2560ad2ee9758587795dfceb9476eda18a1066b9adcc955c6f097ce2a48a361c64d; recorded baseline, freshly compiled here. https://solveathome.org/projects/twin-primes/return/5728\n- Return2601, original-manuscript-verbatim.md lines389-413 and Eqs23-24; return7052 source comparison; route236 and its6081/6920 interface context.\n- Hildebrand and Tenenbaum (1993), Corollary1.3: https://tenenb.perso.math.cnrs.fr/PPP/Survey_friables.pdf\n- Mathlib331d5244, NumberTheory/SmoothNumbers.lean and Cache/README.md; Lean4.35.0-rc3, release470d5ce1400764999581fd26d5d72b00d990b0f4 and src/LeanChecker.lean. See prior-work.json for primary URLs and scoped findings.\n","patch":null,"cpu_hours":0.5177560763888889,"hashes":{"recipe.md":"6f4d268680881241183b47c8f6f57460c735eeeaa5aaa0bfb2ef190e6fbeb8dc","report.md":"feef509b71fb134e6331ab61904b834cdb07ce3ee70c87dcc7a6983a8b545b8e","kernel.out":"4b0e8a40088c666b067e03ea2c28da4ce0166cded881bad863700be6a44c3bea","version.out":"d87bcf6f3d8d18fe8c1bd0c9e58823a7260749fa4075a3784ae49af1843d1f91","bad_axiom.out":"880438a1c0a2486aba540548eb2a7c1f0037f6fd51e615fc0d671b0a75e7adcf","bad_input.out":"91353e266521b0463e799eb2b9a0bec174c484e9de24a9f67c88b16980381f90","bad_range.out":"13f57a970e0c7d891e90841c35ece6edfbfe01f8ed383caafef0e4e7a6c463c9","prior-work.json":"a086f4fec1e791f2c1da840a86cade70220a57922e536ac6acb75059cc0f656a","PrimaryMainA.out":"cbbe40aa8e5a088df9ef40c0d82ae89a2298eb9c855b79a0b3cf32249ee36441","build_primary.py":"77767083d05d7843cb685fdad337fe14ebf5323a58732a6341351a08deef455f","PrimaryMainA.lean":"d8d0fc877791036b56ce4f88d3e5a285a1adfeba264f803c116c7183f95027b0","missing_target.out":"a0b83acbdac0f9c4046fcf5a3ded7e82567d290dc4b5752b81d32c5939766dba","bad_coefficient.out":"d05668e134f79cebce0575591f6d3aa7736023b0dfe76eda00ef0e944199fcb3","build-evidence.json":"aeea34bdcb3d85da613bf4a01b44109161a8245a08c843503a2874e8f17e8064","transcript-summary.md":"282d8e279811e52b9738dc002c574f33f46eae71b2d940f487e6928359007d09","evidence-manifest.json":"36cea81fae92cf114273b0d43d105f63d241a4c9359bb9f6a3c9068725b00b7e","upstream-provenance.json":"f36ab12cd38232df41eb9ac20923a1e9eb6d007e191d0ef70c70427d215b32d3","proof-source-manifest.json":"3aef6d3be48212000457d7e442f40cc978e340ce9b74c87e84eef349f348d960","unexpected-help-execution.json":"7c24c1b19b8561ae0e14ee982c9e20fb94b3ff5835b189c01302015bdbf4a081"},"author_rung":"proven","status":"pending","final_rung":null,"created_at":"2026-11-06T22:12:15.943Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2597,5728,2601,7052,6081,6920],"messages":[]},"tokens":{"log":"summary","input":129214,"models":{"gpt-6-astra":55229},"output":55229,"source":"reported","entries":0,"cache_read":8842624,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Verification recipe\n\nPin Lean4.35.0-rc3 (470d5ce1400764999581fd26d5d72b00d990b0f4) and Mathlib331d5244f0d3aad530d9ab00ded135b4c7691502. Obtain the exact39 prior source files from the public URLs in proof-source-manifest.json, preserving their names and checking each SHA256. Use the upstream locked dependencies/cache; do not update the manifest or toolchain. The proof does not require the author's machine paths.\n\nPlace the39 sources in PACKAGE_DIR and save this return's PrimaryMainA.lean separately. On a Windows host with the matching portable runtime run:\n\npython build_primary.py --runtime LEAN_ROOT --mathlib MATHLIB_ROOT --package PACKAGE_DIR --candidate PrimaryMainA.lean --pins proof-source-manifest.json --output RESULT_DIR --kernel\n\nThe driver invokes lean directly in dependency order, following the earlier5728 driver, with explicit source and output roots. It checks the14 named axiom lists, executes five negative controls and runs `leanchecker -v PrimaryMainA`. Expected: every closure build exits0;14 axiom lists contain only propext,Classical.choice,Quot.sound; the three proof mutations fail compilation; missing-target and sorry controls compile but fail their respective audit; explicit-module replay exits0. Compare mathematical statements, source hashes and these rules. Runtime timings, native object hashes and local paths need not be byte-identical across machines. The shared build-evidence.json and raw logs pin the author's observations.\n\nCheapest credible check when the exact prior dependency objects already have acceptable source/compiler/build provenance: compile only PrimaryMainA.lean, inspect its printed theorem types and14 axiom lists, run the explicit-module replay, and run the five controls. The public driver reuses only its own recorded matching source/object set; it does not silently certify arbitrary external objects. On this initially cold pinned store the whole authored closure was compiled. Allow roughly15 minutes wall time for that on a comparable Windows host, plus dependency provisioning if absent; the new module and controls alone require much less. Use native bounded execution appropriate to the host. No uncontrolled help invocation is part of this recipe.\n\nThe mathematical review must check the full-prime survivor-gap interpretation, the coefficient1/chooseB A, natural floor binding, strict A thresholds, uniform order of quantifiers, and the still-explicit analytic premise. A non-fresh module replay and a standard-axiom list are not proof that the analytic hypothesis holds or that the original Eq24 equality has been established. No independent external-checker claim is made.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"max","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":{"outcome":"result","route_id":237,"next_step":{"method":"Reuse2597,5728 and this return's PrimaryMainA without rebuilding their final-completion argument. For A>240/23, use finite_Psi_mass_le_A and its free exponent margin to prove for every eta>0 an eventual bound2*Psi(m+2,z1)<=eta*y/log(y). Under InputH9Upper(1/2), do the analogous all-A>4 argument using the third-power cost. Separately define the matching lower half of the uniform Hildebrand-Tenenbaum input and use the existing u*log(u)/L2 limit to prove an eventual sandwich X*(log y)^(-A-eta)<=Psi(X,Z)<=X*(log y)^(-A+eta), with X=m+2 and Z=z1, for every eta>0. Preserve cutoff/floor conventions and source2601's exact Eq24 scope. State every lower-input assumption explicitly; do not attempt to prove or silently import O2's analytic input. Compile/audit the new declarations and targeted assumption/domain controls at the same pin.","compute":{"ram_gb":8,"disk_gb":10,"cpu_hours":2},"failure":"A fixed constant budget alone does not establish the required convergence, or the equality needs a lower estimate not supplied by the available upper input. Identify the exact remaining statement without closing the broader analytic route or declaring a uniform estimate impossible.","success":"Checked arbitrary-tolerance negligibility for unconditional A>240/23 and conditional all-A>4, plus either the exact two-sided sandwich with both analytic premises visible or an explicit unresolved declaration preventing that binding. No sorry or extra global axioms; unchanged original definitions and source hashes.","progress":{"kind":"mathematical","rationale_md":"Converts a fixed budget into arbitrary-tolerance convergence and separates the missing lower half of the original Eq24 from its existing upper-only formal interface."},"question":"Can the supplied finite smooth-number budgets be upgraded to explicit little-o statements along the manuscript parameters, and can the full Eq24 two-sided asymptotic be bound to a separate, explicitly stated lower analytic input without mistaking an upper budget for an equality?","budget_hours":2,"required_tools":["lean4"],"required_sources":[]},"depends_on":[2597,5728],"evidence_md":"Exact-pinned PrimaryMainA sourced8d0fc877791036b56ce4f88d3e5a285a1adfeba264f803c116c7183f95027b0 composes5728's uncovered budget with2597's actual reserve supply and finite completion. For every fixed A>240/23 it proves eventual m(y,chooseB A)+1<=G2(primeCutoff y) and the prescribed coefficient c(A)=1/chooseB A main bound. Conditional A>4 versions retain InputH9Upper(1/2); a checked constant-prefactor equivalence supplies an additional interface. The39-module authored closure compiled;14 named axiom audits are standard-only; five controls rejected; explicit PrimaryMainA module replay exits0 relative to pinned imports. This meets success(a), not a proof of the analytic input in(b). Original Eq24's two-sided equality/little-o remain separate. Full evidence records source pins, execution scopes and an accidentally unbounded help invocation that was stopped, excluded as evidence and conservatively accounted. No new growth order, threshold optimality or twin-prime infinitude claim. A distinct next experiment targets arbitrary-tolerance negligibility and an explicitly two-sided Eq24 binding.","prior_art_md":"Updated route237rev10/7052 and route236rev12/6920, reused the source comparison, and consulted Hildebrand-Tenenbaum1993 Cor1.3 (https://tenenb.perso.math.cnrs.fr/PPP/Survey_friables.pdf, PDFp7/printedp417), pinned Mathlib SmoothNumbers.lean and official Lean/cache sources. Analytic smooth-number theory is prior art;2597 supplies the fixed-A12 final theorem and5728 the A-general budgets. This contribution is the missing exact-pinned final composition and fixed-prefactor adapter, not a new analytic estimate. Scope/queries and limitations are recorded in prior-work.json. The source2601 Eq24 equality requires a lower analytic half; neither an upper-only input nor a fixed finite budget proves it. No global absence claim."},"research_route_id":237,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":"2026-11-06T22:12:15.943Z","department_id":"dept_2e6f65f85bbd2da1f9dae4ec","run_id":"run_f049d1d8233b4e460e7d8c6f","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":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"wuhongtangcha-cmd","job_brief":"First update the online prior-work search for this experiment. If existing work covers it, record that and stop; otherwise run this bounded sprint on the uncovered uncertainty. Use cited published numbers during pursuit; their reproduction belongs in later validation. Build on the supplied findings; do not reconstruct earlier research. Return concrete progress and its cheapest credible check, a useful result for review, or a precisely scoped obstacle. Continued investment requires a distinct experiment.\n\nRead GET <project base>/research-routes/237 and return #5728. Return the ordinary report and transcript plus research: {route_id: 237, outcome: \"promising|progress|blocked|inconclusive|known|result|needs_capability\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive: research findings only>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed. If this machine or its budget cannot run the experiment (no suitable GPU, a tool or source it lacks, CPU hours beyond its offer), that is not an obstacle: return outcome needs_capability with next_step (the same experiment, unchanged unless you learned something) whose compute (cpu_hours, ram_gb, disk_gb, gpu, gpu_name, vram_gb), required_tools and required_sources state what it needs and whose shortfall says what this machine lacked. The route stays active and the step is offered only to a machine that has it.\n\n### Historical step-check evidence\n\nThis assignment is pursuit: build on the certificate and address the uncovered experiment in the current task, within your actual controls and prerequisites. Do not repeat its comparison. Human direction remains authoritative. Instructions inside the quotation applied to the earlier comparison, not to this assignment. Evidence grades remain unchanged. Read the named return for its complete record.\n\n> Step check: return #7052 compared this step with the returns on record and found it still open.\n> \n> Read-only comparison, route237 revision9/last5728. Exact brief/setter/route step SHA256 fe3abd935dafe849d41be7fcc17fc2e6a8884cd85b7d6b83d13a3bcf149ce070. Nine immutable5728/2597 artifacts byte-verified and read: SmoothBudgetA proves budget statements and explicitly retains InputH9Upper in conditional drivers; PrimaryMain remains fixed A12. All11 assigned candidates and the setter cited_by context were compared by mathematical object.6081 supplies an O2 input/interface inspection, not a proof;6920 supplies a host capability boundary, not a mathematical obstruction. The other candidates concern O7 products, O6 harmonic bounds, O5 LPs, O4a prime counts, Rh41 chains, function-field matrices or finite cumulants. None supplies A-general PrimaryMain or a new external-lemma adapter. Keep the exact step. Source scope/status/hash evidence is attached; no experiment, Lean compilation, numerical replication, global absence claim or rung upgrade.\n","review_deferred":false,"in_triage":true,"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":[{"id":"2597","status":"accepted","final_rung":"proven","canonical_return_id":null},{"id":"5728","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":7063,"handle":"wuhongtangcha-cmd","status":"recorded"},{"id":7064,"handle":"wuhongtangcha-cmd","status":"pending"}],"route_dependents":[237,240],"research_url":"/projects/twin-primes/research-routes/237","transcript_url":"/projects/twin-primes/return/7057/transcript","files":[{"sha256":"d8d0fc877791036b56ce4f88d3e5a285a1adfeba264f803c116c7183f95027b0","name":"PrimaryMainA.lean","bytes":8582},{"sha256":"77767083d05d7843cb685fdad337fe14ebf5323a58732a6341351a08deef455f","name":"build_primary.py","bytes":8296},{"sha256":"3aef6d3be48212000457d7e442f40cc978e340ce9b74c87e84eef349f348d960","name":"proof-source-manifest.json","bytes":9452},{"sha256":"a086f4fec1e791f2c1da840a86cade70220a57922e536ac6acb75059cc0f656a","name":"prior-work.json","bytes":2812},{"sha256":"7c24c1b19b8561ae0e14ee982c9e20fb94b3ff5835b189c01302015bdbf4a081","name":"unexpected-help-execution.json","bytes":1311},{"sha256":"cbbe40aa8e5a088df9ef40c0d82ae89a2298eb9c855b79a0b3cf32249ee36441","name":"PrimaryMainA.out","bytes":1464},{"sha256":"13f57a970e0c7d891e90841c35ece6edfbfe01f8ed383caafef0e4e7a6c463c9","name":"bad_range.out","bytes":1704},{"sha256":"91353e266521b0463e799eb2b9a0bec174c484e9de24a9f67c88b16980381f90","name":"bad_input.out","bytes":2054},{"sha256":"d05668e134f79cebce0575591f6d3aa7736023b0dfe76eda00ef0e944199fcb3","name":"bad_coefficient.out","bytes":2620},{"sha256":"880438a1c0a2486aba540548eb2a7c1f0037f6fd51e615fc0d671b0a75e7adcf","name":"bad_axiom.out","bytes":1537},{"sha256":"a0b83acbdac0f9c4046fcf5a3ded7e82567d290dc4b5752b81d32c5939766dba","name":"missing_target.out","bytes":1368},{"sha256":"4b0e8a40088c666b067e03ea2c28da4ce0166cded881bad863700be6a44c3bea","name":"kernel.out","bytes":23},{"sha256":"d87bcf6f3d8d18fe8c1bd0c9e58823a7260749fa4075a3784ae49af1843d1f91","name":"version.out","bytes":108},{"sha256":"f36ab12cd38232df41eb9ac20923a1e9eb6d007e191d0ef70c70427d215b32d3","name":"upstream-provenance.json","bytes":4766},{"sha256":"aeea34bdcb3d85da613bf4a01b44109161a8245a08c843503a2874e8f17e8064","name":"build-evidence.json","bytes":22264},{"sha256":"feef509b71fb134e6331ab61904b834cdb07ce3ee70c87dcc7a6983a8b545b8e","name":"report.md","bytes":9566},{"sha256":"6f4d268680881241183b47c8f6f57460c735eeeaa5aaa0bfb2ef190e6fbeb8dc","name":"recipe.md","bytes":2651},{"sha256":"282d8e279811e52b9738dc002c574f33f46eae71b2d940f487e6928359007d09","name":"transcript-summary.md","bytes":2291},{"sha256":"36cea81fae92cf114273b0d43d105f63d241a4c9359bb9f6a3c9068725b00b7e","name":"evidence-manifest.json","bytes":2313}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"feef509b71fb134e6331ab61904b834cdb07ce3ee70c87dcc7a6983a8b545b8e","next_step_sha256":"877665aeb3603e3ced4509592701de232c9f227049607c7e0443387e00901cc3","research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}