[joshlf]

Byte length cannot recover an element count when elements are zero-sized.
Keep the count in slice decoding, and retain each child's metadata when
composing indexed decoders into a sequence.

Prove initialization, realizability for admitted values, and completeness
through physical and mathematical decoding. Check empty uninhabited
slices, distinct zero-byte counts, rejected metadata, and nested indexed
sequences. These are pure representation laws; they do not supply a Rust
layout or pointer-access premise.

Authored by an AI agent acting on joshlf's behalf.

---

• 　  Compose referent content laws at explicit metadata pairs #3895
• 　  Prove the native slice IntoBytes implementation #3894
• 　  Retain indexed storage in Rust model providers #3893
• 👉 Compose byte decoders at explicit element metadata #3892
• 　  Bound pointer projections even for empty referents #3891
• 　  Prove referent validity implications for native trait impls #3890
• 　  Expose wrapper validity impls for independent verification #3889
• 　  Retain every type argument in native trait laws #3888
• 　  Model referent validity as byte-domain inclusion #3887
• 　  Prove a generic owned conversion against byte models #3884
• 　  Require realizable source representations for IntoBytes #3883
• 　  Require fresh ownership proofs before ignoring drops #3882
• 　  Prove conservative ownership checks for conditional drops #3881
• 　  Prove record construction against independent Rust references #3846
• 　  Prove selected cast plans preserve size without metadata overflow #3845
• 　  Prove CastPlan selection and unchecked metadata arithmetic #3844
• 　  Prove cast validation and exact-size metadata inference #3843
• 　  Prove allocation-size preparation and tail containment #3842
• 　  Prove CastUnsized's production layout acceptance gate #3841
• 　  Prove the numerical bounds used by split operations #3840
• 　  Prove advancement and padding-sequence decisions #3839
• 　  Prove DstLayout padding and field extension #3838
• 　  Prove unit and usize PointerMetadata operations #3837
• 　  Prove trailing sizes, padding and capacity including overflow #3836
• 　  Prove and consume the Unaligned alignment law #3862
• 　  Prove primitive DstLayout constructors #3835
• 　  Add an independent Rust reference for nested DST sizes #3834
• 　  Specify rounding encodings as alignment and phase #3833
• 　  Relate recursive record layout to normalized size formulas #3832
• 　  Prove normalized trailing-size and capacity formulas #3831
• 　  Reuse Aeneas rules for views and indexed loops #3830
• 　  Prove least padding and greatest aligned predecessors #3829
• 　  Test total and partial Aeneas contract semantics #3828
• 　  Verify Boolean and NonZeroUsize candidate predicates #3852
• 　  Verify the byte writers used by IntoBytes #3851
• 　  Prove FromZeros::new_zeroed through its enclosing trait law #3880
• 　  Prove FromBytes and FromZeros construction invariants #3879
• 　  Express Alignment::read's pointer guarantees as a tuple #3878
• 　  Prove wrapper and byteorder IntoBytes implementations #3872
• 　  Prove scalar and PhantomData IntoBytes implementations #3871
• 　  Prove concrete owned standard transmutation #3877
• 　  Prove array IntoBytes initialization from element laws #3863
• 　  Check trait invariants on exact Aeneas dictionaries #3861
• 　  Prove U16 and U32 byte-order reads, writes and updates #3827
• 　  Prove guarded Boolean conversion and byte copying #3849
• 　  Reject unsupported execution effects before Aeneas lowering #3848
• 　  Check Rust specs against golden and live Aeneas models #3826
• 　  Separate cast plans from pointer reconstruction #3825
• 　  Move cast_from into layout/cast_from.rs #3824
• 　  Share Rust layout, storage and pointer models in anneal/lean #3823
• 　  Check reconstructed layouts against compiler layout queries #3860
• 　  Preserve Lake declarations and traces when vendoring #3875

⬇️ Download this PR

Branch

git fetch origin refs/heads/Grpvcydhrmu5xhlrgdma3sjuwlvxdozc6 && git checkout -b pr-Grpvcydhrmu5xhlrgdma3sjuwlvxdozc6 FETCH_HEAD

Checkout

git fetch origin refs/heads/Grpvcydhrmu5xhlrgdma3sjuwlvxdozc6 && git checkout FETCH_HEAD

Cherry Pick

git fetch origin refs/heads/Grpvcydhrmu5xhlrgdma3sjuwlvxdozc6 && git cherry-pick FETCH_HEAD

Pull

git pull origin refs/heads/Grpvcydhrmu5xhlrgdma3sjuwlvxdozc6

Stacked PRs enabled by GHerrit.

[chatgpt-codex-connector]

Codex Review Summary

This comment shows the latest Codex review activity on this pull request.

Review	Status	Commit	Review trigger
📝 Code Review	✅ Completed 2026-10-15T22:21:44.372817Z	41a2b65	PR opened
🔒 Security Review	✅ Completed 2026-10-15T22:23:04.292866Z	41a2b65	PR opened

ℹ️ About Codex in GitHub

Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you

• Open a pull request for review
• Mark a draft as ready
• Comment "@codex review" or "@codex security review".

Codex reacts with 👀 while any review is running, comments if it has suggestions, and reacts with 👍 once all reviews finish with no findings.

[gemini-code-assist]

Code Review

This pull request extends the Lean formalization of Rust storage decoders by introducing the sequence decoder, which composes repeated uses of a storage decoder, and proving its properties regarding initialization, realizability, and completeness. It also adds several theorems for sliceDecoder and arrayDecoder, alongside comprehensive test cases in ReferentTests.lean and RustStorageTests.lean covering edge cases such as zero-byte widths and empty types. There are no review comments, and we have no feedback to provide.

[codecov-commenter]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 48.67%. Comparing base (6afb011) to head (41a2b65).

Additional details and impacted files

@@                        Coverage Diff                         @@
##           Gsul3w4vydc4wowguwwscielqttbpeytg    #3892   +/-   ##
==================================================================
  Coverage                              48.67%   48.67%           
==================================================================
  Files                                     35       35           
  Lines                                   4754     4754           
==================================================================
  Hits                                    2314     2314           
  Misses                                  2440     2440           

☔ View full report in Codecov by Harness.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.