lean-roundtrip-proofs
CommunityProve Lean 4 encode/decode roundtrips.
Software Engineering#formal verification#theorem proving#lean4#data compression#roundtrip proofs#suffix invariance
Authorkim-em
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This Skill provides a structured approach and reusable patterns for proving the correctness of encoding and decoding functions in Lean 4, specifically focusing on roundtrip theorems where encoding followed by decoding returns the original data.
Core Features & Use Cases
- Suffix Invariance: Prove that extra bits appended to input do not affect decoding.
- Decode-With-Remaining: Analyze what bits are left after decoding, crucial for padding and framing.
- Padding Extraction: Demonstrate that encoded data is byte-aligned with less than 8 padding bits.
- Composing Proofs: Combine per-level proofs into a unified, top-level roundtrip theorem.
- Iterative Equivalence: Prove that iterative and recursive implementations are equivalent.
Quick Start
Use the lean-roundtrip-proofs skill to generate suffix invariance lemmas for a given decoder function.
Dependency Matrix
Required Modules
None requiredComponents
references
💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: lean-roundtrip-proofs Download link: https://github.com/kim-em/lean-zip/archive/main.zip#lean-roundtrip-proofs Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.