# Repro - SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity

## Pages

| Page |
| --- |
| [Claim 1: Coverage theorem](#/claim-1-coverage-theorem) |
| [Claim 2: Theoretical speedup bound](#/claim-2-theoretical-speedup-bound) |
| [Claim 3: A100 Qwen2.5-7B prefill](#/claim-3-a100-qwen2-5-7b-prefill) |
| [Claim 4: Kernel performance](#/claim-4-kernel-performance) |
| [Claim 5: Qwen3 reasoning accuracy](#/claim-5-qwen3-reasoning-accuracy) |
| [Claim 6: Decode performance](#/claim-6-decode-performance) |
| [Conclusion](#/conclusion) |