+cd script
+```
+
+## Manual
+
+You can also manually setup a project. First create a new cargo project:
+
+```bash
+cargo new script
+cd script
+```
+
+#### Cargo Manifest
+
+Inside this crate, add the `sp1-sdk` crate as a dependency. Your `Cargo.toml` should look like as follows:
+
+```rust
+[workspace]
+[package]
+version = "0.1.0"
+name = "script"
+edition = "2021"
+
+[dependencies]
+sp1-sdk = "2.0.0"
+```
+
+The `sp1-sdk` crate includes the necessary utilities to generate, save, and verify proofs.
diff --git a/book/versioned_docs/version-3.4.0/generating-proofs/sp1-sdk-faq.md b/book/versioned_docs/version-3.4.0/generating-proofs/sp1-sdk-faq.md
new file mode 100644
index 0000000000..ca2a0a0596
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/generating-proofs/sp1-sdk-faq.md
@@ -0,0 +1,15 @@
+# FAQ
+
+## Logging and Tracing Information
+
+You can use `sp1_sdk::utils::setup_logger()` to enable logging information respectively. You can set the logging level with the `RUST_LOG` environment variable.
+
+```rust
+sp1_sdk::utils::setup_logger();
+```
+
+Example of setting the logging level to `info` (other options are `debug`, `trace`, and `warn`):
+
+```bash
+RUST_LOG=info cargo run --release
+```
\ No newline at end of file
diff --git a/book/versioned_docs/version-3.4.0/getting-started/hardware-requirements.md b/book/versioned_docs/version-3.4.0/getting-started/hardware-requirements.md
new file mode 100644
index 0000000000..828ea96080
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/getting-started/hardware-requirements.md
@@ -0,0 +1,41 @@
+# Proof Generation Requirements
+
+
+We recommend that developers who want to use SP1 for non-trivial programs generate proofs on our prover network. The prover network generates SP1 proofs across multiple machines, reducing latency and also runs SP1 on optimized hardware instances that result in faster + cheaper proof generation times.
+
+We recommend that for any production benchmarking, you use the prover network to estimate latency and costs of proof generation.
+
+
+
+## Local Proving
+
+If you want to generate SP1 proofs locally, this section has an overview of the hardware requirements required. These requires depend on which [types of proofs](../generating-proofs/proof-types.md) you want to generate and can also change over time as the design of the zKVM evolves.
+
+**The most important requirement is CPU for performance/latency and RAM to prevent running out of memory.**
+
+| | Mock / Network | Core / Compress | Groth16 and PLONK (EVM) |
+| -------------- | ---------------------------- | ---------------------------------- | ----------------------- |
+| CPU | 1+, single-core perf matters | 16+, more is better | 16+, more is better |
+| Memory | 8GB+, more is better | 16GB+, more if you have more cores | 16GB+, more is better |
+| Disk | 10GB+ | 10GB+ | 10GB+ |
+| EVM Compatible | ✅ | ❌ | ✅ |
+
+### CPU
+
+The execution & trace generation of the zkVM is mostly CPU bound, having a high single-core
+performance is recommended to accelerate these steps. The rest of the prover is mostly bound by hashing/field operations
+which can be parallelized with multiple cores.
+
+### Memory
+
+Our prover requires keeping large matrices (i.e., traces) in memory to generate the proofs. Certain steps of the prover
+have a minimum memory requirement, meaning that if you have less than this amount of memory, the process will OOM.
+
+This effect is most noticeable when using the Groth16 or PLONK provers.
+
+### Disk
+
+Disk is required to install the SP1 zkVM toolchain and to install the circuit artifacts, if you
+plan to locally build the Groth16 or PLONK provers.
+
+Furthermore, disk is used to checkpoint the state of the program execution, which is required to generate the proofs.
diff --git a/book/versioned_docs/version-3.4.0/getting-started/install.md b/book/versioned_docs/version-3.4.0/getting-started/install.md
new file mode 100644
index 0000000000..e58b9a624e
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/getting-started/install.md
@@ -0,0 +1,115 @@
+# Installation
+
+SP1 currently runs on Linux and macOS. You can either use prebuilt binaries through sp1up or
+build the Succinct [Rust toolchain](https://rust-lang.github.io/rustup/concepts/toolchains.html) and CLI from source.
+
+## Requirements
+
+- [Git](https://git-scm.com/book/en/v2/Getting-Started-Installing-Git)
+- [Rust (Nightly)](https://www.rust-lang.org/tools/install)
+- [Docker](https://docs.docker.com/get-docker/)
+
+## Option 1: Prebuilt Binaries (Recommended)
+
+`sp1up` is the SP1 toolchain installer. Open your terminal and run the following command and follow the instructions:
+
+```bash
+curl -L https://sp1.succinct.xyz | bash
+```
+
+Then simply follow the instructions on-screen, which will make the `sp1up` command available in your CLI.
+
+After following the instructions, you can run `sp1up` to install the toolchain and the `cargo prove` CLI:
+
+```bash
+sp1up
+```
+
+This will install two things:
+
+1. The `succinct` Rust toolchain which has support for the `riscv32im-succinct-zkvm-elf` compilation target.
+2. `cargo prove` CLI tool that provides convenient commands for compiling SP1 programs and other helper functionality.
+
+You can verify the installation of the CLI by running `cargo prove --version`:
+
+```bash
+cargo prove --version
+```
+
+You can check the version of the Succinct Rust toolchain by running:
+
+```bash
+RUSTUP_TOOLCHAIN=succinct cargo --version
+```
+or equivalently:
+
+```bash
+cargo +succinct --version
+```
+
+If this works, go to the [next section](./quickstart.md) to compile and prove a simple zkVM program.
+
+### Troubleshooting
+
+#### Rate-limiting
+
+If you experience [rate-limiting](https://docs.github.com/en/rest/using-the-rest-api/getting-started-with-the-rest-api?apiVersion=2022-11-28#rate-limiting) when using the `sp1up` command, you can resolve this by using the `--token` flag and providing your GitHub token. To create a Github token, follow the instructions [here](https://docs.github.com/en/authentication/keeping-your-account-and-data-secure/managing-your-personal-access-tokens#creating-a-personal-access-token-classic).
+
+
+
+#### Unsupported OS Architectures
+
+Currently our prebuilt binaries are built on Ubuntu 20.04 (22.04 on ARM) and macOS. If your OS uses an older GLIBC version, it's possible these may not work and you will need to [build the toolchain from source](#option-2-building-from-source).
+
+#### Conflicting `cargo-prove` installations
+
+If you have installed `cargo-prove` from source, it may conflict with `sp1up`'s `cargo-prove` installation or vice versa. You can remove the `cargo-prove` that was installed from source with the following command:
+
+```bash
+rm ~/.cargo/bin/cargo-prove
+```
+
+Or, you can remove the `cargo-prove` that was installed through `sp1up`:
+
+```bash
+rm ~/.sp1/bin/cargo-prove
+```
+
+
+## Option 2: Building from Source
+
+
+Warning: This option will take a long time to build and is only recommended for advanced users.
+
+
+Make sure you have installed the [dependencies](https://github.com/rust-lang/rust/blob/master/INSTALL.md#dependencies) needed to build the rust toolchain from source.
+
+Clone the `sp1` repository and navigate to the root directory.
+
+```bash
+git clone git@github.com:succinctlabs/sp1.git
+cd sp1
+cd crates
+cd cli
+cargo install --locked --path .
+cd ~
+cargo prove build-toolchain
+```
+
+Building the toolchain can take a while, ranging from 30 mins to an hour depending on your machine. If you're on a machine that we have prebuilt binaries for (ARM Mac or x86 or ARM Linux), you can use the following to download a prebuilt version.
+
+```bash
+cargo prove install-toolchain
+```
+
+To verify the installation of the toolchain, run and make sure you see `succinct`:
+
+```bash
+rustup toolchain list
+```
+
+You can delete your existing installation of the toolchain with:
+
+```bash
+rustup toolchain remove succinct
+```
diff --git a/book/versioned_docs/version-3.4.0/getting-started/project-template.md b/book/versioned_docs/version-3.4.0/getting-started/project-template.md
new file mode 100644
index 0000000000..b6cbd8d733
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/getting-started/project-template.md
@@ -0,0 +1,5 @@
+# Project Template
+
+Another option for getting started with SP1 is to use the [SP1 Project Template](https://github.com/succinctlabs/sp1-project-template/tree/main).
+
+You can use this as a Github template to create a new repository that has a SP1 program, a script to generate proofs, and also a contracts folder that contains a Solidity contract that can verify SP1 proofs on any EVM chain.
diff --git a/book/versioned_docs/version-3.4.0/getting-started/quickstart.md b/book/versioned_docs/version-3.4.0/getting-started/quickstart.md
new file mode 100644
index 0000000000..0d7f46821e
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/getting-started/quickstart.md
@@ -0,0 +1,124 @@
+# Quickstart
+
+In this section, we will show you how to create a simple Fibonacci program using the SP1 zkVM.
+
+## Create an SP1 Project
+
+### Option 1: Cargo Prove New CLI (Recommended)
+
+You can use the `cargo prove` CLI to create a new project using the `cargo prove new <--bare|--evm> ` command. The `--bare` option sets up a basic SP1 project for standalone zkVM programs, while `--evm` adds additional components including Solidity contracts for on-chain proof verification.
+
+This command will create a new folder in your current directory which includes solidity smart contracts for onchain integration.
+
+```bash
+cargo prove new --evm fibonacci
+cd fibonacci
+```
+
+### Option 2: Project Template (Solidity Contracts for Onchain Verification)
+
+If you want to use SP1 to generate proofs that will eventually be verified on an EVM chain, you should use the [SP1 project template](https://github.com/succinctlabs/sp1-project-template/tree/main). This Github template is scaffolded with a SP1 program, a script to generate proofs, and also a contracts folder that contains a Solidity contract that can verify SP1 proofs on any EVM chain.
+
+Either fork the project template repository or clone it:
+
+```bash
+git clone https://github.com/succinctlabs/sp1-project-template.git
+```
+
+### Project Overview
+
+Your new project will have the following structure (ignoring the `contracts` folder, if you are using the project template):
+
+```
+.
+├── program
+│ ├── Cargo.lock
+│ ├── Cargo.toml
+│ ├── elf
+│ │ └── riscv32im-succinct-zkvm-elf
+│ └── src
+│ └── main.rs
+├── rust-toolchain
+└── script
+ ├── Cargo.lock
+ ├── Cargo.toml
+ ├── build.rs
+ └── src
+ └── bin
+ ├── prove.rs
+ └── vkey.rs
+
+6 directories, 4 files
+```
+
+There are 2 directories (each a crate) in the project:
+- `program`: the source code that will be proven inside the zkVM.
+- `script`: code that contains proof generation and verification code.
+
+**We recommend you install the [rust-analyzer](https://marketplace.visualstudio.com/items?itemName=rust-lang.rust-analyzer) extension.**
+Note that if you use `cargo prove new` inside a monorepo, you will need to add the manifest file to `rust-analyzer.linkedProjects` to get full IDE support.
+
+## Build
+
+Before we can run the program inside the zkVM, it must be compiled to a RISC-V executable using the `succinct` Rust toolchain. This is called an [ELF (Executable and Linkable Format)](https://en.wikipedia.org/wiki/Executable_and_Linkable_Format). To compile the program, you can run the following command:
+
+```
+cd program && cargo prove build
+```
+
+which will output the compiled ELF to the file `program/elf/riscv32im-succinct-zkvm-elf`.
+
+Note: the `build.rs` file in the `script` directory will use run the above command automatically to build the ELF, meaning you don't have to manually run `cargo prove build` every time you make a change to the program!
+
+## Execute
+
+To test your program, you can first execute your program without generating a proof. In general this is helpful for iterating on your program and verifying that it is correct.
+
+```bash
+cd ../script
+RUST_LOG=info cargo run --release -- --execute
+```
+
+## Prove
+
+When you are ready to generate a proof, you should run the script with the `--prove` flag that will generate a proof.
+
+```bash
+cd ../script
+RUST_LOG=info cargo run --release -- --prove
+```
+
+The output should show something like this:
+```
+n: 20
+2024-07-23T17:07:07.874856Z INFO prove_core:collect_checkpoints: clk = 0 pc = 0x2017e8
+2024-07-23T17:07:07.876264Z INFO prove_core:collect_checkpoints: close time.busy=2.00ms time.idle=1.50µs
+2024-07-23T17:07:07.913304Z INFO prove_core:shard: close time.busy=32.2ms time.idle=791ns
+2024-07-23T17:07:10.724280Z INFO prove_core:commit: close time.busy=2.81s time.idle=1.25µs
+2024-07-23T17:07:10.725923Z INFO prove_core:prove_checkpoint: clk = 0 pc = 0x2017e8 num=0
+2024-07-23T17:07:10.729130Z INFO prove_core:prove_checkpoint: close time.busy=3.68ms time.idle=1.17µs num=0
+2024-07-23T17:07:14.648146Z INFO prove_core: execution report (totals): total_cycles=9329, total_syscall_cycles=20
+2024-07-23T17:07:14.648180Z INFO prove_core: execution report (opcode counts):
+2024-07-23T17:07:14.648197Z INFO prove_core: 1948 add
+...
+2024-07-23T17:07:14.648277Z INFO prove_core: execution report (syscall counts):
+2024-07-23T17:07:14.648408Z INFO prove_core: 8 commit
+...
+2024-07-23T17:07:14.648858Z INFO prove_core: summary: cycles=9329, e2e=9.193968459, khz=1014.69, proofSize=1419780
+2024-07-23T17:07:14.653193Z INFO prove_core: close time.busy=9.20s time.idle=12.2µs
+Successfully generated proof!
+fib(n): 10946
+```
+
+The program by default is quite small, so proof generation will only take a few seconds locally. After it generates, the proof will be verified for correctness.
+
+**Note:** When benchmarking proof generation times locally, it is important to note that there is a fixed overhead for proving, which means that the proof generation time for programs with a small number of cycles is not representative of the performance of larger programs (which often have better performance characteristics as the overhead is amortized across many cycles).
+
+## Recommended Workflow
+
+Please see the [Recommended Workflow](../generating-proofs/recommended-workflow) section for more details on how to develop your SP1 program and generate proofs.
+
+We *strongly recommend* that developers who want to use SP1 for non-trivial programs generate proofs on the beta version of our [Prover Network](../generating-proofs/prover-network.md). The prover network generates SP1 proofs across multiple machines, reducing latency and also runs SP1 on optimized hardware instances that result in faster + cheaper proof generation times.
+
+We recommend that for any production benchmarking, you use the prover network to estimate latency and costs of proof generation. We also would love to chat with your team directly to help you get started with the prover network--please fill out this [form](https://partner.succinct.xyz/).
+
diff --git a/book/versioned_docs/version-3.4.0/introduction.md b/book/versioned_docs/version-3.4.0/introduction.md
new file mode 100644
index 0000000000..f3a645786c
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/introduction.md
@@ -0,0 +1,33 @@
+# Introduction
+
+*Documentation for SP1 users and developers*.
+
+[![Telegram Chat][tg-badge]][tg-url]
+
+
+
+
+SP1 is a performant, open-source zero-knowledge virtual machine (zkVM) that verifies the execution of arbitrary Rust (or any LLVM-compiled language) programs.
+
+[tg-badge]: https://img.shields.io/endpoint?color=neon&logo=telegram&label=chat&url=https%3A%2F%2Ftg.sumanjay.workers.dev%2Fsuccinct%5Fsp1
+[tg-url]: https://t.me/+AzG4ws-kD24yMGYx
+
+SP1 has undergone multiple audits from leading ZK security firms and is currently used in production by many top blockchain teams.
+
+## The future of ZK is writing normal code
+
+Zero-knowledge proofs (ZKPs) are one of the most critical technologies to blockchain scaling, interoperability and privacy. But, historically building ZKP systems was extremely complicated--requiring large teams with specialized cryptography expertise and taking years to go to production.
+
+SP1 provides a performant, general-purpose zkVM that enables **any developer** to use ZKPs by writing normal code (in Rust), and get cheap and fast proofs. SP1 will enable ZKPs to become mainstream, introducing a new era of verifiability for all of blockchain infrastructure and beyond.
+
+
+## SP1 enables a diversity of use-cases
+
+ZKPs enable a diversity of use-cases in blockchain and beyond, including:
+
+* Rollups: Use SP1 to generate a ZKP for the state transition function of your rollup and connect to Ethereum, Bitcoin or other chains with full validity proofs or ZK fraud proofs.
+* Interoperability: Use SP1 for fast-finality, cross rollup interoperability
+* Bridges: Use SP1 to generate a ZKP for verifying consensus of L1s, including Tendermint, Ethereum’s Light Client protocol and more, for bridging between chains.
+* Oracles: Use SP1 for large scale computations with onchain state, including consensus data and storage data.
+* Aggregation: Use SP1 to aggregate and verify other ZKPs for reduced onchain verification costs.
+* Privacy: Use SP1 for onchain privacy, including private transactions and private state.
diff --git a/book/versioned_docs/version-3.4.0/sp1.png b/book/versioned_docs/version-3.4.0/sp1.png
new file mode 100644
index 0000000000..78576befe3
Binary files /dev/null and b/book/versioned_docs/version-3.4.0/sp1.png differ
diff --git a/book/versioned_docs/version-3.4.0/theme/head.hbs b/book/versioned_docs/version-3.4.0/theme/head.hbs
new file mode 100644
index 0000000000..2e2be7a19f
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/theme/head.hbs
@@ -0,0 +1,6 @@
+
+
+
+
+
\ No newline at end of file
diff --git a/book/versioned_docs/version-3.4.0/verification/off-chain-verification.md b/book/versioned_docs/version-3.4.0/verification/off-chain-verification.md
new file mode 100644
index 0000000000..6d218c49bb
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/verification/off-chain-verification.md
@@ -0,0 +1,48 @@
+import ProgramMain from "../../../static/examples_groth16_program_src_main.rs.mdx";
+import ProgramScript from "../../../static/examples_groth16_script_src_main.rs.mdx";
+
+# Offchain Verification
+
+## Rust `no_std` Verification
+
+You can verify SP1 Groth16 and Plonk proofs in `no_std` environments with [`sp1-verifier`](https://docs.rs/sp1-verifier/latest/sp1_verifier/).
+
+`sp1-verifier` is also patched to verify Groth16 and Plonk proofs within the SP1 ZKVM, using
+[bn254](https://blog.succinct.xyz/succinctshipsprecompiles/) precompiles. For an example of this, see
+the [Groth16 Example](https://github.com/succinctlabs/sp1/tree/main/examples/groth16/).
+
+### Installation
+
+Import the following dependency in your `Cargo.toml`:
+
+```toml
+sp1-verifier = {version = "3.0.0", default-features = false}
+```
+
+### Usage
+
+`sp1-verifier`'s interface is very similar to the solidity verifier's. It exposes two public functions:
+[`Groth16Verifier::verify_proof`](https://docs.rs/sp1-verifier/latest/src/sp1_verifier/groth16.rs.html)
+and [`PlonkVerifier::verify_proof`](https://docs.rs/sp1-verifier/latest/src/sp1_verifier/plonk.rs.html).
+
+`sp1-verifier` also exposes the Groth16 and Plonk verifying keys as constants, `GROTH16_VK_BYTES` and `PLONK_VK_BYTES`. These
+keys correspond to the current SP1 version's official Groth16 and Plonk verifying keys, which are used for verifying proofs generated
+using docker or the prover network.
+
+First, generate your groth16/plonk proof with the SP1 SDK. See [here](./onchain/getting-started#generating-sp1-proofs-for-onchain-verification)
+for more information -- `sp1-verifier` and the solidity verifier expect inputs in the same format.
+
+Next, verify the proof with `sp1-verifier`. The following snippet is from the [Groth16 example program](https://github.com/succinctlabs/sp1/tree/dev/examples/groth16/), which verifies a Groth16 proof within SP1 using `sp1-verifier`.
+
+
+
+Here, the proof, public inputs, and vkey hash are read from stdin. See the following snippet to see how these values are generated.
+
+
+
+> Note that the SP1 SDK itself is *not* `no_std` compatible.
+
+## Wasm Verification
+
+The [`example-sp1-wasm-verifier`](https://github.com/succinctlabs/example-sp1-wasm-verifier) demonstrates how to
+verify SP1 proofs in wasm. For a more detailed explanation of the process, please see the [README](https://github.com/succinctlabs/example-sp1-wasm-verifier/blob/main/README.md).
diff --git a/book/onchain-verification/contract-addresses.md b/book/versioned_docs/version-3.4.0/verification/onchain/contract-addresses.md
similarity index 68%
rename from book/onchain-verification/contract-addresses.md
rename to book/versioned_docs/version-3.4.0/verification/onchain/contract-addresses.md
index 3acb971edf..0a23f6ab2e 100644
--- a/book/onchain-verification/contract-addresses.md
+++ b/book/versioned_docs/version-3.4.0/verification/onchain/contract-addresses.md
@@ -6,6 +6,27 @@ will automatically route your SP1 proof to the correct verifier based on the SP1
## Canonical Verifier Gateways
+There are different verifier gateway for each proof system: Groth16 and PLONK. This means that you
+must use the correct verifier gateway depending on if you are verifying a Groth16 or PLONK proof.
+
+### Groth16
+
+| Chain ID | Chain | Gateway |
+| -------- | ---------------- | --------------------------------------------------------------------------------------------------------------------------------------- |
+| 1 | Mainnet | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://etherscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 11155111 | Sepolia | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://sepolia.etherscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 17000 | Holesky | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://holesky.etherscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 42161 | Arbitrum One | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://arbiscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 421614 | Arbitrum Sepolia | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://sepolia.arbiscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 8453 | Base | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://basescan.org/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 84532 | Base Sepolia | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://sepolia.basescan.org/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 10 | Optimism | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://optimistic.etherscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 11155420 | Optimism Sepolia | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://sepolia-optimism.etherscan.io/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 534351 | Scroll Sepolia | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://sepolia.scrollscan.com/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+| 534352 | Scroll | [0x397A5f7f3dBd538f23DE225B51f532c34448dA9B](https://scrollscan.com/address/0x397A5f7f3dBd538f23DE225B51f532c34448dA9B) |
+
+### PLONK
+
| Chain ID | Chain | Gateway |
| -------- | ---------------- | --------------------------------------------------------------------------------------------------------------------------------------- |
| 1 | Mainnet | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://etherscan.io/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
@@ -16,7 +37,7 @@ will automatically route your SP1 proof to the correct verifier based on the SP1
| 8453 | Base | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://basescan.org/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
| 84532 | Base Sepolia | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://sepolia.basescan.org/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
| 10 | Optimism | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://optimistic.etherscan.io/address/0x3b6041173b80e77f038f3f2c0f9744f04837185e) |
-| 11155420 | Optimism Sepolia | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://sepolia-optimism.etherscan.io/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
+| 11155420 | Optimism Sepolia | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://sepolia-optimism.etherscan.io/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
| 534351 | Scroll Sepolia | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://sepolia.scrollscan.com/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
| 534352 | Scroll | [0x3B6041173B80E77f038f3F2C0f9744f04837185e](https://scrollscan.com/address/0x3B6041173B80E77f038f3F2C0f9744f04837185e) |
diff --git a/book/onchain-verification/getting-started.md b/book/versioned_docs/version-3.4.0/verification/onchain/getting-started.mdx
similarity index 93%
rename from book/onchain-verification/getting-started.md
rename to book/versioned_docs/version-3.4.0/verification/onchain/getting-started.mdx
index 834a23dc18..7556372f03 100644
--- a/book/onchain-verification/getting-started.md
+++ b/book/versioned_docs/version-3.4.0/verification/onchain/getting-started.mdx
@@ -1,3 +1,5 @@
+import Example from "../../../../static/examples_fibonacci_script_bin_groth16_bn254.rs.mdx";
+
# Onchain Verification: Setup
The best way to get started with verifying SP1 proofs on-chain is to refer to the [SP1 Project Template](https://github.com/succinctlabs/sp1-project-template/tree/main).
@@ -6,7 +8,7 @@ The best way to get started with verifying SP1 proofs on-chain is to refer to th
- The template [script](https://github.com/succinctlabs/sp1-project-template/blob/main/script/src/bin/prove.rs) shows how to generate the proof using the SDK and save it to a file.
- The template [contract](https://github.com/succinctlabs/sp1-project-template/blob/main/contracts/src/Fibonacci.sol) shows how to verify the proof onchain using Solidity.
-Refer to the section on [Contract Addresses](./contract-addresses.md#contract-addresses) for the addresses of the deployed verifiers.
+Refer to the section on [Contract Addresses](./contract-addresses) for the addresses of the deployed verifiers.
## Generating SP1 Proofs for Onchain Verification
@@ -18,9 +20,7 @@ By default, the proofs generated by SP1 are not verifiable onchain, as they are
### Example
-```rust,noplayground
-{{#include ../../examples/fibonacci/script/bin/groth16_bn254.rs}}
-```
+
You can run the above script with `RUST_LOG=info cargo run --bin groth16_bn254 --release` in `examples/fibonacci/script`.
diff --git a/book/verification/onchain/solidity-sdk.md b/book/versioned_docs/version-3.4.0/verification/onchain/solidity-sdk.md
similarity index 100%
rename from book/verification/onchain/solidity-sdk.md
rename to book/versioned_docs/version-3.4.0/verification/onchain/solidity-sdk.md
diff --git a/book/versioned_docs/version-3.4.0/what-is-a-zkvm.md b/book/versioned_docs/version-3.4.0/what-is-a-zkvm.md
new file mode 100644
index 0000000000..4f91fa3213
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/what-is-a-zkvm.md
@@ -0,0 +1,35 @@
+# What is a zkVM?
+
+A zero-knowledge virtual machine (zkVM) is zero-knowledge proof system that allows developers to prove the execution of arbitrary Rust (or other LLVM-compiled language) programs.
+
+Conceptually, you can think of the SP1 zkVM as proving the evaluation of a function `f(x) = y` by following the steps below:
+
+- Define `f` using normal Rust code and compile it to an ELF (covered in the [writing programs](./writing-programs/setup.md) section).
+- Setup a proving key (`pk`) and verifying key (`vk`) for the program given the ELF.
+- Generate a proof `π` using the SP1 zkVM that `f(x) = y` with `prove(pk, x)`.
+- Verify the proof `π` using `verify(vk, x, y, π)`.
+
+As a practical example, `f` could be a simple Fibonacci [program](https://github.com/succinctlabs/sp1/blob/main/examples/fibonacci/program/src/main.rs). The process of generating a proof and verifying it can be seen [here](https://github.com/succinctlabs/sp1/blob/main/examples/fibonacci/script/src/main.rs).
+
+For blockchain applications, the verification usually happens inside of a [smart contract](https://github.com/succinctlabs/sp1-project-template/blob/main/contracts/src/Fibonacci.sol).
+
+## How does SP1 Work?
+
+At a high level, SP1 works with the following steps:
+
+* Write a program in Rust that defines the logic of your computation for which you want to generate a ZKP.
+* Compile the program to the RISC-V ISA (a standard Rust compilation target) using the `cargo prove` CLI tool (installation instructions [here](./getting-started/install.md)) and generate a RISC-V ELF file.
+* SP1 will prove the correct execution of arbitrary RISC-V programs by generating a STARK proof of execution.
+* Developers can leverage the `sp1-sdk` crate to generate proofs with their ELF and input data. Under the hood the `sp1-sdk` will either generate proofs locally or use a beta version of Succinct's prover network to generate proofs.
+
+SP1 leverages performant STARK recursion that allows us to prove the execution of arbitrarily long programs and also has a STARK -> SNARK "wrapping system" that allows us to generate small SNARK proofs that can be efficiently verified on EVM chains.
+
+## Proof System
+
+For more technical details, check out the SP1 technical note that explains our proof system in detail. In short, we use:
+
+* STARKs + FRI over the Baby Bear field
+* We use performant STARK recursion that allows us to prove the execution of arbitrarily long programs
+* We have a system of performant precompiles that accelerate hash functions and cryptographic signature verification that allow us to get substantial performance gains on blockchain workloads
+
+
diff --git a/book/versioned_docs/version-3.4.0/why-use-sp1.md b/book/versioned_docs/version-3.4.0/why-use-sp1.md
new file mode 100644
index 0000000000..44db0ab6bc
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/why-use-sp1.md
@@ -0,0 +1,46 @@
+# Why use SP1?
+
+## Use-Cases
+
+Zero-knowledge proofs (ZKPs) are a powerful primitive that enable **verifiable computation**. With ZKPs, anyone can verify a cryptographic proof that a program has executed correctly, without needing to trust the prover, re-execute the program or even know the inputs to the program.
+
+Historically, building ZKP systems has been extremely complicated, requiring large teams with specialized cryptography expertise and taking years to go to production. SP1 is a performant, general-purpose zkVM that solves this problem and creates a future where all blockchain infrastructure, including rollups, bridges, coprocessors, and more, utilize ZKPs **via maintainable software written in Rust**.
+
+SP1 is especially powerful in blockchain contexts which rely on verifiable computation. Example applications include:
+- [Rollups](https://ethereum.org/en/developers/docs/scaling/zk-rollups/): SP1 can be used in combination with existing node infrastructure like [Reth](https://github.com/paradigmxyz/reth) to build rollups with ZKP validity proofs or ZK fraud proofs.
+- [Coprocessors](https://crypto.mirror.xyz/BFqUfBNVZrqYau3Vz9WJ-BACw5FT3W30iUX3mPlKxtA): SP1 can be used to outsource onchain computation to offchain provers to enable use cases such as large-scale computation over historical state and onchain machine learning, dramatically reducing gas costs.
+- [Light Clients](https://ethereum.org/en/developers/docs/nodes-and-clients/light-clients/): SP1 can be used to build light clients that can verify the state of other chains, facilitating interoperability between different blockchains without relying on any trusted third parties.
+
+SP1 has already been integrated in many of these applications, including but not limited to:
+
+- [SP1 Tendermint](https://github.com/succinctlabs/sp1-tendermint-example): An example of a ZK Tendermint light client on Ethereum powered by SP1.
+- [SP1 Reth](https://github.com/succinctlabs/rsp): A performant, type-1 zkEVM written in Rust & SP1 using Reth.
+- [SP1 Contract Call](https://github.com/succinctlabs/sp1-contract-call): A lightweight library to generate ZKPs of Ethereum smart contract execution
+- and many more!
+
+SP1 is used by protocols in production today:
+
+- [SP1 Blobstream](https://github.com/succinctlabs/sp1-blobstream): A bridge that verifies [Celestia](https://celestia.org/) “data roots” (a commitment to all data blobs posted in a range of Celestia blocks) on Ethereum and other EVM chains.
+- [SP1 Vector](https://github.com/succinctlabs/sp1-vector): A bridge that relays [Avail's](https://www.availproject.org/) merkle root to Ethereum and also functions as a token bridge from Avail to Ethereum.
+
+
+## 100x developer productivity
+
+SP1 enables teams to use ZKPs in production with minimal overhead and fast timelines.
+
+**Maintainable:** With SP1, you can reuse existing Rust crates, like `revm`, `reth`, `tendermint-rs`, `serde` and more, to write your ZKP logic in maintainable, Rust code.
+
+**Go to market faster:** By reusing existing crates and expressing ZKP logic in regular code, SP1 significantly reduces audit surface area and complexity, enabling teams to go to market with ZKPs faster.
+
+## Blazing Fast Performance
+
+SP1 is the fastest zkVM and has blazing fast performance on a variety of realistic blockchain workloads, including light clients and rollups. With SP1, ZKP proving costs are an order of magnitude less than alternative zkVMs or even circuits, making it cost-effective and fast for practical use.
+
+Read more about our benchmarking results [here](https://blog.succinct.xyz/sp1-benchmarks-8-6-24).
+
+## Open Source
+
+SP1 is 100% open-source (MIT / Apache 2.0) with no code obfuscation and built to be contributor friendly, with all development done in the open. Unlike existing zkVMs whose constraint logic is closed-source and impossible to audit or modify, SP1 is modularly architected and designed to be customizable from day one. This customizability (unique to SP1) allows for users to add “precompiles” to the core zkVM logic that yield substantial performance gains, making SP1’s performance not only SOTA vs. existing zkVMs, but also competitive with circuits in a variety of use-cases.
+
+
+
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/basics.mdx b/book/versioned_docs/version-3.4.0/writing-programs/basics.mdx
new file mode 100644
index 0000000000..7eb28e7004
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/basics.mdx
@@ -0,0 +1,15 @@
+import Example from "../../../static/examples_fibonacci_program_src_main.rs.mdx";
+
+# Basics
+
+The easiest way to understand how to write programs for the SP1 zkVM is to look at some examples.
+
+## Example: Fibonacci
+
+This program is from the `examples` [directory](https://github.com/succinctlabs/sp1/tree/main/examples) in the SP1 repo which contains several example programs of varying complexity.
+
+
+
+As you can see, writing programs is as simple as writing normal Rust.
+
+After you've written your program, you must compile it to an ELF that the SP1 zkVM can prove. To read more about compiling programs, refer to the section on [Compiling Programs](./compiling). To read more about how inputs and outputs work, refer to the section on [Inputs & Outputs](./inputs-and-outputs).
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/compiling.mdx b/book/versioned_docs/version-3.4.0/writing-programs/compiling.mdx
new file mode 100644
index 0000000000..b5b66cb7f7
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/compiling.mdx
@@ -0,0 +1,100 @@
+import Example from "../../../static/examples_fibonacci_script_build.rs.mdx";
+
+# Compiling Programs
+
+Once you have written an SP1 program, you must compile it to an ELF file that can be executed in the zkVM. The `cargo prove` CLI tool (downloaded during installation) provides convenient commands for compiling SP1 programs.
+
+## Development Builds
+
+> WARNING: This may not generate a reproducible ELF which is necessary for verifying that your binary corresponds to given source code.
+>
+> Use the [reproducible build system](#production-builds) for production builds.
+
+To build a program while developing, simply run the following command in the crate that contains your SP1 program:
+
+```bash
+cargo prove build
+```
+
+This will compile the ELF that can be executed in the zkVM and put it in the file `elf/riscv32im-succinct-zkvm-elf`. The output from the command will look something like this:
+
+```bash
+[sp1] Compiling version_check v0.9.4
+[sp1] Compiling proc-macro2 v1.0.86
+[sp1] Compiling unicode-ident v1.0.12
+[sp1] Compiling cfg-if v1.0.0
+...
+[sp1] Compiling sp1-lib v1.0.1
+[sp1] Compiling sp1-zkvm v1.0.1
+[sp1] Compiling fibonacci-program v0.1.0 (/Users/username/Documents/fibonacci/program)
+[sp1] Finished `release` profile [optimized] target(s) in 8.33s
+```
+
+Under the hood, this CLI command calls `cargo build` with the `riscv32im-succinct-zkvm-elf` target and other required environment variables and flags. The logic for this command is defined in the [sp1-build](https://github.com/succinctlabs/sp1/tree/main/build) crate.
+
+### Advanced Build Options
+
+You can pass additional arguments to the `cargo prove build` command to customize the build process, like configuring what features are enabled, customizing the output directory and more. To see all available options, run `cargo prove build --help`. Many of these options mirror the options available in the `cargo build` command.
+
+## Production Builds
+
+For production builds of programs, you can build your program inside a Docker container which will generate a **reproducible ELF** on all platforms. To do so, just use the `--docker` flag and optionally the `--tag` flag with the release version you want to use (defaults to `latest`). For example:
+
+```bash
+cargo prove build --docker --tag v1.0.1
+```
+
+To verify that your build is reproducible, you can compute the SHA-512 hash of the ELF on different platforms and systems with:
+
+```bash
+$ shasum -a 512 elf/riscv32im-succinct-zkvm-elf
+f9afb8caaef10de9a8aad484c4dd3bfa54ba7218f3fc245a20e8a03ed40b38c617e175328515968aecbd3c38c47b2ca034a99e6dbc928512894f20105b03a203
+```
+
+## Build Script
+
+If you want your program crate to be built automatically whenever you build/run your script crate, you can add a `build.rs` file inside of `script/` (at the same level as `Cargo.toml` of your script crate) that utilizes the `sp1-build` crate:
+
+
+
+The path passed in to `build_program` should point to the directory containing the `Cargo.toml` file for your program. Make sure to also add `sp1-build` as a build dependency in `script/Cargo.toml`:
+
+```toml
+[build-dependencies]
+sp1-build = "2.0.0"
+```
+
+You will see output like the following from the build script if the program has changed, indicating that the program was rebuilt:
+
+```
+[fibonacci-script 0.1.0] cargo:rerun-if-changed=../program/src
+[fibonacci-script 0.1.0] cargo:rerun-if-changed=../program/Cargo.toml
+[fibonacci-script 0.1.0] cargo:rerun-if-changed=../program/Cargo.lock
+[fibonacci-script 0.1.0] cargo:warning=fibonacci-program built at 2024-03-02 22:01:26
+[fibonacci-script 0.1.0] [sp1] Compiling fibonacci-program v0.1.0 (/Users/umaroy/Documents/fibonacci/program)
+[fibonacci-script 0.1.0] [sp1] Finished release [optimized] target(s) in 0.15s
+warning: fibonacci-script@0.1.0: fibonacci-program built at 2024-03-02 22:01:26
+```
+
+The above output was generated by running `RUST_LOG=info cargo run --release -vv` for the `script` folder of the Fibonacci example.
+
+### Advanced Build Options
+
+To configure the build process when using the `sp1-build` crate, you can pass a [`BuildArgs`](https://docs.rs/sp1-build/1.2.0/sp1_build/struct.BuildArgs.html) struct to to the [`build_program_with_args`](https://docs.rs/sp1-build/1.2.0/sp1_build/fn.build_program_with_args.html) function. The build arguments are the same as the ones available from the `cargo prove build` command.
+
+As an example, you could use the following code to build the Fibonacci example with the `docker` flag set to `true` and a custom output directory for the generated ELF:
+
+```rust
+use sp1_build::{build_program_with_args, BuildArgs};
+
+fn main() {
+ let args = BuildArgs {
+ docker: true,
+ output_directory: "./fibonacci-program".to_string(),
+ ..Default::default()
+ };
+ build_program_with_args("../program", &args);
+}
+```
+
+**Note:** If you want reproducible builds with the `build.rs` approach, you should use the `docker` flag and the `build_program_with_args` function, as shown in the example above.
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/cycle-tracking.mdx b/book/versioned_docs/version-3.4.0/writing-programs/cycle-tracking.mdx
new file mode 100644
index 0000000000..ea45fb26bd
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/cycle-tracking.mdx
@@ -0,0 +1,124 @@
+import Example from "../../../static/examples_cycle-tracking_program_bin_normal.rs.mdx";
+
+# Cycle Tracking
+
+When writing a program, it is useful to know how many RISC-V cycles a portion of the program takes to identify potential performance bottlenecks. SP1 provides a way to track the number of cycles spent in a portion of the program.
+
+## Tracking Cycles with Annotations
+
+To track the number of cycles spent in a portion of the program, you can either put `println!("cycle-tracker-start: block name")` + `println!("cycle-tracker-end: block name")` statements (block name must be same between start and end) around the portion of your program you want to profile or use the `#[sp1_derive::cycle_tracker]` macro on a function. An example is shown below:
+
+
+
+Note that to use the macro, you must add the `sp1-derive` crate to your dependencies for your program.
+
+```toml
+[dependencies]
+sp1-derive = "2.0.0"
+```
+
+In the script for proof generation, setup the logger with `utils::setup_logger()` and run the script with `RUST_LOG=info cargo run --release`. You should see the following output:
+
+```
+$ RUST_LOG=info cargo run --release
+ Finished release [optimized] target(s) in 0.21s
+ Running `target/release/cycle-tracking-script`
+2024-03-13T02:03:40.567500Z INFO execute: loading memory image
+2024-03-13T02:03:40.567751Z INFO execute: starting execution
+2024-03-13T02:03:40.567760Z INFO execute: clk = 0 pc = 0x2013b8
+2024-03-13T02:03:40.567822Z INFO execute: ┌╴setup
+2024-03-13T02:03:40.568095Z INFO execute: └╴4,398 cycles
+2024-03-13T02:03:40.568122Z INFO execute: ┌╴main-body
+2024-03-13T02:03:40.568149Z INFO execute: │ ┌╴expensive_function
+2024-03-13T02:03:40.568250Z INFO execute: │ └╴1,368 cycles
+stdout: result: 5561
+2024-03-13T02:03:40.568373Z INFO execute: │ ┌╴expensive_function
+2024-03-13T02:03:40.568470Z INFO execute: │ └╴1,368 cycles
+stdout: result: 2940
+2024-03-13T02:03:40.568556Z INFO execute: └╴5,766 cycles
+2024-03-13T02:03:40.568566Z INFO execute: finished execution clk = 11127 pc = 0x0
+2024-03-13T02:03:40.569251Z INFO execute: close time.busy=1.78ms time.idle=21.1µs
+```
+
+Note that we elegantly handle nested cycle tracking, as you can see above.
+
+### Get Tracked Cycle Counts
+
+To include tracked cycle counts in the `ExecutionReport` when using `ProverClient::execute`, use the following annotations:
+
+```rust
+fn main() {
+ println!("cycle-tracker-report-start: block name");
+ // ...
+ println!("cycle-tracker-report-end: block name");
+}
+```
+
+This will log the cycle count for `block name` and include it in the `ExecutionReport` in the `cycle_tracker` map.
+
+## Tracking Cycles with Tracing
+
+The `cycle-tracker` annotation is a convenient way to track cycles for specific sections of code. However, sometimes it can also be useful to track what functions are taking the most cycles across the entire program, without having to annotate every function individually.
+
+First, we need to generate a trace file of the program counter at each cycle while the program is executing. This can be done by simply setting the `TRACE_FILE` environment variable with the path of the file you want to write the trace to. For example, you can run the following command in the `script` directory for any example program:
+
+```bash
+TRACE_FILE=trace.log RUST_LOG=info cargo run --release
+```
+
+When the `TRACE_FILE` environment variable is set, as SP1's RISC-V runtime is executing, it will write a log of the program counter to the file specified by `TRACE_FILE`.
+
+Next, we can use the `cargo prove` CLI with the `trace` command to analyze the trace file and generate a table of instruction counts. This can be done with the following command:
+
+```bash
+cargo prove trace --elf --trace
+```
+
+The `trace` command will generate a table of instruction counts, sorted by the number of cycles spent in each function. The output will look something like this:
+
+```
+ [00:00:00] [########################################] 17053/17053 (0s)
+
+Total instructions in trace: 17053
+
+
+ Instruction counts considering call graph
++----------------------------------------+-------------------+
+| Function Name | Instruction Count |
+| __start | 17045 |
+| main | 12492 |
+| sp1_zkvm::syscalls::halt::syscall_halt | 4445 |
+| sha2::sha256::compress256 | 4072 |
+| sp1_lib::io::commit | 258 |
+| sp1_lib::io::SyscallWriter::write | 255 |
+| syscall_write | 195 |
+| memcpy | 176 |
+| memset | 109 |
+| sp1_lib::io::read_vec | 71 |
+| __rust_alloc | 29 |
+| sp1_zkvm::heap::SimpleAlloc::alloc | 22 |
+| syscall_hint_len | 3 |
+| syscall_hint_read | 2 |
++----------------------------------------+-------------------+
+
+
+ Instruction counts ignoring call graph
++----------------------------------------+-------------------+
+| Function Name | Instruction Count |
+| main | 12075 |
+| sha2::sha256::compress256 | 4073 |
+| sp1_zkvm::syscalls::halt::syscall_halt | 219 |
+| memcpy | 180 |
+| syscall_write | 123 |
+| memset | 111 |
+| sp1_lib::io::commit | 88 |
+| sp1_lib::io::SyscallWriter::write | 60 |
+| __start | 45 |
+| sp1_lib::io::read_vec | 35 |
+| sp1_zkvm::heap::SimpleAlloc::alloc | 23 |
+| anonymous | 7 |
+| __rust_alloc | 7 |
+| syscall_hint_len | 4 |
+| syscall_hint_read | 3 |
++----------------------------------------+-------------------+
+```
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/inputs-and-outputs.mdx b/book/versioned_docs/version-3.4.0/writing-programs/inputs-and-outputs.mdx
new file mode 100644
index 0000000000..62c0e62bb5
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/inputs-and-outputs.mdx
@@ -0,0 +1,67 @@
+import Example from "../../../static/examples_io_program_src_main.rs.mdx";
+
+# Inputs and Outputs
+
+In real world applications of zero-knowledge proofs, you almost always want to verify your proof in the context of some inputs and outputs. For example:
+
+- **Rollups**: Given a list of transactions, prove the new state of the blockchain.
+- **Coprocessors**: Given a block header, prove the historical state of some storage slot inside a smart contract.
+- **Attested Images**: Given a signed image, prove that you made a restricted set of image transformations.
+
+In this section, we cover how you pass inputs and outputs to the zkVM and create new types that support serialization.
+
+## Reading Data
+
+Data that is read is not public to the verifier by default. Use the `sp1_zkvm::io::read::` method:
+
+```rust
+let a = sp1_zkvm::io::read::();
+let b = sp1_zkvm::io::read::();
+let c = sp1_zkvm::io::read::();
+```
+
+Note that `T` must implement the `serde::Serialize` and `serde::Deserialize` trait. If you want to read bytes directly, you can also use the `sp1_zkvm::io::read_vec` method.
+
+```rust
+let my_vec = sp1_zkvm::io::read_vec();
+```
+
+## Committing Data
+
+Committing to data makes the data public to the verifier. Use the `sp1_zkvm::io::commit::` method:
+
+```rust
+sp1_zkvm::io::commit::(&a);
+sp1_zkvm::io::commit::(&b);
+sp1_zkvm::io::commit::(&c);
+```
+
+Note that `T` must implement the `Serialize` and `Deserialize` trait. If you want to write bytes directly, you can also use `sp1_zkvm::io::commit_slice` method:
+
+```rust
+let mut my_slice = [0_u8; 32];
+sp1_zkvm::io::commit_slice(&my_slice);
+```
+
+## Creating Serializable Types
+
+Typically, you can implement the `Serialize` and `Deserialize` traits using a simple derive macro on a struct.
+
+```rust
+use serde::{Serialize, Deserialize};
+
+#[derive(Serialize, Deserialize)]
+struct MyStruct {
+ a: u32,
+ b: u64,
+ c: String
+}
+```
+
+For more complex usecases, refer to the [Serde docs](https://serde.rs/).
+
+## Example
+
+Here is a basic example of using inputs and outputs with more complex types.
+
+
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/patched-crates.md b/book/versioned_docs/version-3.4.0/writing-programs/patched-crates.md
new file mode 100644
index 0000000000..818190f2ee
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/patched-crates.md
@@ -0,0 +1,234 @@
+# Patched Crates
+
+We maintain forks of commonly used libraries in blockchain infrastructure to significantly accelerate the execution of certain operations.
+Under the hood, we use [precompiles](./precompiles) to achieve tremendous performance improvements in proof generation time.
+
+**If you know of a library or library version that you think should be patched, please open an issue or a pull request!**
+
+## Supported Libraries
+
+| Crate Name | Repository | Notes | Versions |
+|---------------------|---------------------------------------------------------------------------------------|------------------|-----------------------|
+| sha2 | [sp1-patches/RustCrypto-hashes](https://github.com/sp1-patches/RustCrypto-hashes) | sha256 | 0.9.8, 0.10.6, 0.10.8 |
+| sha3 | [sp1-patches/RustCrypto-hashes](https://github.com/sp1-patches/RustCrypto-hashes) | keccak256 | 0.9.8, 0.10.6, 0.10.8 |
+| bigint | [sp1-patches/RustCrypto-bigint](https://github.com/sp1-patches/RustCrypto-bigint) | bigint | 0.5.5 |
+| tiny-keccak | [sp1-patches/tiny-keccak](https://github.com/sp1-patches/tiny-keccak) | keccak256 | 2.0.2 |
+| curve25519-dalek | [sp1-patches/curve25519-dalek](https://github.com/sp1-patches/curve25519-dalek) | ed25519 verify | 4.1.3, 3.2.0 |
+| curve25519-dalek-ng | [sp1-patches/curve25519-dalek-ng](https://github.com/sp1-patches/curve25519-dalek-ng) | ed25519 verify | 4.1.1 |
+| ed25519-consensus | [sp1-patches/ed25519-consensus](http://github.com/sp1-patches/ed25519-consensus) | ed25519 verify | 2.1.0 |
+| ed25519-dalek | [sp1-patches/ed25519-dalek](http://github.com/sp1-patches/ed25519-dalek) | ed25519 verify | 1.0.1 |
+| ecdsa-core | [sp1-patches/signatures](http://github.com/sp1-patches/signatures) | secp256k1 verify | 0.16.8, 0.16.9 |
+| secp256k1 | [sp1-patches/rust-secp256k1](http://github.com/sp1-patches/rust-secp256k1) | secp256k1 verify | 0.29.0, 0.29.1 |
+| substrate-bn | [sp1-patches/bn](https://github.com/sp1-patches/bn) | BN254 | 0.6.0 |
+| bls12_381 | [sp1-patches/bls12_381](https://github.com/sp1-patches/bls12_381) | BLS12-381 | 0.8.0 |
+
+## Using Patched Crates
+
+To use the patched libraries, you can use corresponding patch entries in your program's `Cargo.toml` such as:
+
+```toml
+[patch.crates-io]
+sha2-v0-9-8 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha2", tag = "sha2-v0.9.8-patch-v1" }
+sha2-v0-10-6 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha2", tag = "sha2-v0.10.6-patch-v1" }
+sha2-v0-10-8 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha2", tag = "sha2-v0.10.8-patch-v1" }
+sha3-v0-9-8 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha3", tag = "sha3-v0.9.8-patch-v1" }
+sha3-v0-10-6 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha3", tag = "sha3-v0.10.6-patch-v1" }
+sha3-v0-10-8 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha3", tag = "sha3-v0.10.8-patch-v1" }
+crypto-bigint = { git = "https://github.com/sp1-patches/RustCrypto-bigint", tag = "crypto_bigint-v0.5.5-patch-v1" }
+tiny-keccak = { git = "https://github.com/sp1-patches/tiny-keccak", tag = "tiny_keccak-v2.0.2-patch-v1" }
+substrate-bn = { git = "https://github.com/sp1-patches/bn", tag = "substrate_bn-v0.6.0-patch-v1" }
+bls12_381 = { git = "https://github.com/sp1-patches/bls12_381", tag = "bls12_381-v0.8.0-patch-v1" }
+
+# For sp1 versions >= 3.4.0
+curve25519-dalek = { git = "https://github.com/sp1-patches/curve25519-dalek", tag = "patch-v4.1.3-v3.4.0" }
+# For sp1 versions < 3.4.0
+curve25519-dalek = { git = "https://github.com/sp1-patches/curve25519-dalek", tag = "curve25519_dalek-v4.1.3-patch-v1" }
+curve25519-dalek-ng = { git = "https://github.com/sp1-patches/curve25519-dalek-ng", tag = "curve25519_dalek_ng-v4.1.1-patch-v1" }
+ed25519-consensus = { git = "https://github.com/sp1-patches/ed25519-consensus", tag = "ed25519_consensus-v2.1.0-patch-v1" }
+# For sp1 versions >= 3.3.0
+ecdsa-core = { git = "https://github.com/sp1-patches/signatures", package = "ecdsa", tag = "ecdsa-v0.16.9-patch-v3.3.0" }
+secp256k1 = { git = "https://github.com/sp1-patches/rust-secp256k1", tag = "secp256k1-v0.29.0-patch-v3.3.0" }
+# For sp1 versions < 3.3.0
+ecdsa-core = { git = "https://github.com/sp1-patches/signatures", package = "ecdsa", tag = "ecdsa-v0.16.9-patch-v1" }
+secp256k1 = { git = "https://github.com/sp1-patches/rust-secp256k1", tag = "secp256k1-v0.29.0-patch-v1" }
+```
+
+If you are patching a crate from Github instead of from crates.io, you need to specify the
+repository in the patch section. For example:
+
+```toml
+[patch."https://github.com/RustCrypto/hashes"]
+sha3 = { git = "https://github.com/sp1-patches/RustCrypto-hashes", package = "sha3", tag = "sha3-v0.10.8-patch-v1" }
+```
+
+An example of using patched crates is available in our [Tendermint Example](https://github.com/succinctlabs/sp1/blob/main/examples/tendermint/program/Cargo.toml#L22-L25).
+
+## Ed25519 Acceleration
+
+To accelerate Ed25519 operations, you'll need to patch crates depending on if you're using the `ed25519-consensus` or `ed25519-dalek` library in your program or dependencies.
+
+Generally, `ed25519-consensus` has better performance than `ed25519-dalek` by a factor of 2.
+
+### Patches
+
+Apply the following patches based on what crates are in your dependencies.
+
+- `ed25519-consensus`
+
+ ```toml
+ ed25519-consensus = { git = "https://github.com/sp1-patches/ed25519-consensus", tag = "ed25519_consensus-v2.1.0-patch-v1" }
+ ```
+
+ Note: The curve operations for Ed25519 occur mainly inside of `curve25519-dalek-ng`, but the crate also exposes
+ a `u32_backend` feature flag which accelerates signature recovery by 10% over the default `u64_backend`, which is why
+ `ed25519-consensus` is patched rather than `ed25519-dalek`.
+
+- `ed25519-dalek`
+
+ If using `ed25519-dalek` version `2.1`, you can patch it with the following:
+
+ ```toml
+ curve25519-dalek = { git = "https://github.com/sp1-patches/curve25519-dalek", tag = "curve25519_dalek-v4.1.3-patch-v1" }
+ ```
+
+ If using `ed25519-dalek` version `1.0.1`, you can patch it with the following:
+
+ ```toml
+ ed25519-dalek = { git = "https://github.com/sp1-patches/ed25519-dalek", tag = "ed25519_dalek-v1.0.1-patch-v1" }
+ ```
+
+ Note: We need to patch the underlying Ed25519 curve operations in the `curve25519-dalek` crate. `ed25519-dalek`
+ version `2.1` uses `curve25519-dalek` version `4.1.3`, while `1.0.1` uses `3.2.0`. For version `2.1`, we patch
+ `curve25519-dalek` directly, while for version `1.0.1`, we patch `ed25519-dalek`.
+
+- `curve25519-dalek`
+
+ ```toml
+ curve25519-dalek = { git = "https://github.com/sp1-patches/curve25519-dalek", tag = "curve25519_dalek-v4.1.3-patch-v1" }
+ ```
+
+- `curve25519-dalek-ng`
+
+ ```toml
+ curve25519-dalek-ng = { git = "https://github.com/sp1-patches/curve25519-dalek-ng", tag = "curve25519_dalek_ng-v4.1.1-patch-v1" }
+ ```
+
+## Secp256k1 Acceleration
+
+To accelerate Secp256k1 operations, you'll need to patch `k256` or `secp256k1` depending on your usage.
+
+Generally, if a crate you're using (ex. `revm`) has support for using `k256` instead of `secp256k1`, you should use `k256`.
+
+### Patches
+
+Apply the following patches based on what crates are in your dependencies.
+
+- `k256`
+
+ ```toml
+ ecdsa-core = { git = "https://github.com/sp1-patches/signatures", package = "ecdsa", tag = "ecdsa-v0.16.9-patch-v1" }
+ ```
+
+ Note: The curve operations for `k256` are inside of the `ecdsa-core` crate, so you don't need to patch `k256` itself, and just patching `ecdsa-core` is enough.
+
+- `secp256k1`
+
+ ```toml
+ secp256k1 = { git = "https://github.com/sp1-patches/rust-secp256k1", tag = "secp256k1-v0.29.0-patch-v1" }
+ ```
+
+## BN254 Acceleration
+
+To accelerate BN254 (Also known as BN128 and Alt-BN128), you will need to patch the `substrate-bn` crate.
+
+### Patches
+
+Apply the patch by adding the following to your list of dependencies:
+
+```rust
+substrate-bn = { git = "https://github.com/sp1-patches/bn", tag = "substrate_bn-v0.6.0-patch-v1" }
+```
+
+### Performance Benchmarks for Patched `substrate-bn` in `revm`
+
+| Operation | Standard `substrate-bn` Cycles | Patched `substrate-bn` Cycles | Times Faster |
+| --------- | ------------------------------ | ----------------------------- | ------------ |
+| run-add | 170,298 | 111,615 | 1.52 |
+| run-mul | 1,860,836 | 243,830 | 7.64 |
+| run-pair | 255,627,625 | 11,528,503 | 22.15 |
+
+Note: The operations `run-add`, `run-mul`, and `run-pair` are from the `revm` crate, specifically from the file `crates/precompile/src/bn128.rs` on GitHub. In the patched version of the `substrate-bn` crate, these functions utilize SP1's BN254 Fp precompiles.
+
+To accelerate [revm](https://github.com/bluealloy/revm) in SP1 using the BN254 patched crate, replace the `substrate-bn` crate with the patched crate by adding the following to `crates/precompile/Cargo.toml`:
+
+```toml
+bn = { git = "https://github.com/sp1-patches/bn", package = "substrate-bn", tag = "substrate_bn-v0.6.0-patch-v1" }
+```
+
+## BLS12-381 Acceleration
+
+To accelerate BLS12-381 operations, you'll need to patch the `bls12_381` crate. Apply the following patch by adding the following to your list of dependencies:
+
+```toml
+bls12_381 = { git = "https://github.com/sp1-patches/bls12_381", tag = "bls12_381-v0.8.0-patch-v1" }
+```
+
+This patch significantly improves the performance of BLS12-381 operations, making it essential for applications that rely heavily on these cryptographic primitives.
+
+### Performance Benchmarks for Patched `bls12_381` in [`kzg-rs`](https://github.com/succinctlabs/kzg-rs)
+
+| Test | Unpatched Cycles | Patched Cycles | Improvement (x faster) |
+| -------------------------------------- | ---------------- | -------------- | ---------------------- |
+| Verify blob KZG proof | 265,322,934 | 27,166,173 | 9.77x |
+| Verify blob KZG proof batch (10 blobs) | 1,228,277,089 | 196,571,578 | 6.25x |
+| Evaluate polynomial in evaluation form | 90,717,711 | 59,370,556 | 1.53x |
+| Compute challenge | 63,400,511 | 57,341,532 | 1.11x |
+| Verify KZG proof | 212,708,597 | 9,390,640 | 22.65x |
+
+## Troubleshooting
+
+### Verifying Patch Usage: Cargo
+
+You can check if the patch was applied by using cargo's tree command to print the dependencies of the crate you patched.
+
+```bash
+cargo tree -p sha2@0.9.8
+```
+
+Next to the package name, it should have a link to the Github repository that you patched with.
+
+Ex.
+
+```text
+sha2 v0.9.8 (https://github.com/sp1-patches/RustCrypto-hashes?branch=patch-sha2-v0.9.8#afdbfb09)
+├── ...
+```
+
+### Verifying Patch Usage: SP1
+
+To check if a precompile is used by your program, you can view SP1's ExecutionReport, which is returned when executing a program with `execute`. In `ExecutionReport` you can view the `syscall_counts` map to view if a specific syscall was used.
+
+For example, if you wanted to check `sha256` was used, you would look for `SHA_EXTEND` and `SHA_COMPRESS` in `syscall_counts`.
+
+An example of this is available in our [Patch Testing Example](https://github.com/succinctlabs/sp1/blob/dd032eb23949828d244d1ad1f1569aa78155837c/examples/patch-testing/script/src/main.rs).
+
+### Cargo Version Issues
+
+If you encounter issues with version commits on your patches, you should try updating the patched crate manually.
+
+```bash
+cargo update -p
+```
+
+If you encounter issues relating to cargo / git, you can try setting `CARGO_NET_GIT_FETCH_WITH_CLI`:
+
+```bash
+CARGO_NET_GIT_FETCH_WITH_CLI=true cargo update -p
+```
+
+You can permanently set this value in `~/.cargo/config`:
+
+```toml
+[net]
+git-fetch-with-cli = true
+```
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/precompiles.mdx b/book/versioned_docs/version-3.4.0/writing-programs/precompiles.mdx
new file mode 100644
index 0000000000..a8883d478a
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/precompiles.mdx
@@ -0,0 +1,24 @@
+import Example from "../../../static/crates_zkvm_lib_src_lib.rs.mdx";
+import CodeBlock from '@theme/CodeBlock';
+
+# Precompiles
+
+Precompiles are built into the SP1 zkVM and accelerate commonly used operations such as elliptic curve arithmetic and hashing. Under the hood, precompiles are implemented as custom STARK tables dedicated to proving one or few operations. **They typically improve the performance
+of executing expensive operations in SP1 by a few orders of magnitude.**
+
+Inside the zkVM, precompiles are exposed as system calls executed through the `ecall` RISC-V instruction.
+Each precompile has a unique system call number and implements an interface for the computation.
+
+SP1 also has been designed specifically to make it easy for external contributors to create and extend the zkVM with their own precompiles.
+To learn more about this, you can look at implementations of existing precompiles in the [precompiles](https://github.com/succinctlabs/sp1/tree/main/crates/core/executor/src/events/precompiles) folder. More documentation on this will be coming soon.
+
+**To use precompiles, we typically recommend you interact with them through [patches](./patched-crates.md), which are crates modified
+to use these precompiles under the hood, without requiring you to call system calls directly.**
+
+## Specification
+
+If you are an advanced user you can interact with the precompiles directly using external system calls.
+
+Here is a list of all available system calls & precompiles.
+
+
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/proof-aggregation.md b/book/versioned_docs/version-3.4.0/writing-programs/proof-aggregation.md
new file mode 100644
index 0000000000..dc13d6e42c
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/proof-aggregation.md
@@ -0,0 +1,58 @@
+# Proof Aggregation
+
+SP1 supports proof aggregation and recursion, which allows you to verify an SP1 proof within SP1. Use cases include:
+
+- Reducing on-chain verification costs by aggregating multiple SP1 proofs into a single SP1 proof.
+- Proving logic that is split into multiple proofs, such as proving a statement about a rollup's state transition function by proving each block individually and aggregating these proofs to produce a final proof of a range of blocks.
+
+**For an example of how to use proof aggregation and recursion in SP1, refer to the [aggregation example](https://github.com/succinctlabs/sp1/blob/main/examples/aggregation/script/src/main.rs).**
+
+Note that to verify an SP1 proof inside SP1, you must generate a "compressed" SP1 proof (see [Proof Types](../generating-proofs/proof-types.md) for more details).
+
+### When to use aggregation
+
+Note that by itself, SP1 can already prove arbitrarily large programs by chunking the program's execution into multiple "shards" (contiguous batches of cycles) and generating proofs for each shard in parallel, and then recursively aggregating the proofs. Thus, aggregation is generally **not necessary** for most use-cases, as SP1's proving for large programs is already parallelized. However, aggregation can be useful for aggregating computations that require more than the zkVM's limited (~2GB) memory or for aggregating multiple SP1 proofs from different parties into a single proof to save on onchain verification costs.
+
+## Verifying Proofs inside the zkVM
+
+To verify a proof inside the zkVM, you can use the `sp1_zkvm::lib::verify::verify_sp1_proof` function.
+
+```rust
+sp1_zkvm::lib::verify::verify_sp1_proof(vkey, public_values_digest);
+```
+
+**You do not need to pass in the proof as input into the syscall, as the proof will automatically be read for the proof input stream by the prover.**
+
+Note that you must include the `verify` feature in your `Cargo.toml` for `sp1-zkvm` to be able to use the `verify_proof` function (like [this](https://github.com/succinctlabs/sp1/blob/main/examples/aggregation/program/Cargo.toml#L11)).
+
+## Generating Proofs with Aggregation
+
+To provide an existing proof as input to the SP1 zkVM, you can use the existing `SP1Stdin` object
+which is already used for all inputs to the zkVM.
+
+```rust
+# Generating proving key and verifying key.
+let (input_pk, input_vk) = client.setup(PROOF_INPUT_ELF);
+let (aggregation_pk, aggregation_vk) = client.setup(AGGREGATION_ELF);
+
+// Generate a proof that will be recursively verified / aggregated. Note that we use the "compressed"
+// proof type, which is necessary for aggregation.
+let mut stdin = SP1Stdin::new();
+let input_proof = client
+ .prove(&input_pk, stdin)
+ .compressed()
+ .run()
+ .expect("proving failed");
+
+// Create a new stdin object to write the proof and the corresponding verifying key to.
+let mut stdin = SP1Stdin::new();
+stdin.write_proof(input_proof, input_vk);
+
+// Generate a proof that will recursively verify / aggregate the input proof.
+let aggregation_proof = client
+ .prove(&aggregation_pk, stdin)
+ .compressed()
+ .run()
+ .expect("proving failed");
+
+```
diff --git a/book/versioned_docs/version-3.4.0/writing-programs/setup.md b/book/versioned_docs/version-3.4.0/writing-programs/setup.md
new file mode 100644
index 0000000000..2cd677f4a9
--- /dev/null
+++ b/book/versioned_docs/version-3.4.0/writing-programs/setup.md
@@ -0,0 +1,50 @@
+# Setup
+
+In this section, we will teach you how to setup a self-contained crate which can be compiled as a program that can be executed inside the zkVM.
+
+## Create Project with CLI (Recommended)
+
+The recommended way to setup your first program to prove inside the zkVM is using the method described in [Quickstart](../getting-started/quickstart.md) which will create a program folder.
+
+```bash
+cargo prove new
+cd program
+```
+
+## Manual Project Setup
+
+You can also manually setup a project. First create a new Rust project using `cargo`:
+
+```bash
+cargo new program
+cd program
+```
+
+### Cargo Manifest
+
+Inside this crate, add the `sp1-zkvm` crate as a dependency. Your `Cargo.toml` should look like the following:
+
+```rust
+[workspace]
+[package]
+version = "0.1.0"
+name = "program"
+edition = "2021"
+
+[dependencies]
+sp1-zkvm = "2.0.0"
+```
+
+The `sp1-zkvm` crate includes necessary utilities for your program, including handling inputs and outputs,
+precompiles, patches, and more.
+
+### main.rs
+
+Inside the `src/main.rs` file, you must make sure to include these two lines to ensure that your program properly compiles to a valid SP1 program.
+
+```rust
+#![no_main]
+sp1_zkvm::entrypoint!(main);
+```
+
+These two lines of code wrap your main function with some additional logic to ensure that your program compiles correctly with the RISC-V target.
diff --git a/book/versioned_sidebars/version-3.4.0-sidebars.json b/book/versioned_sidebars/version-3.4.0-sidebars.json
new file mode 100644
index 0000000000..0e9b005f29
--- /dev/null
+++ b/book/versioned_sidebars/version-3.4.0-sidebars.json
@@ -0,0 +1,98 @@
+{
+ "docs": [
+ "introduction",
+ {
+ "type": "category",
+ "label": "Getting Started",
+ "items": [
+ "getting-started/install",
+ "getting-started/quickstart",
+ "getting-started/hardware-requirements",
+ "getting-started/project-template"
+ ],
+ "collapsed": false
+ },
+ {
+ "type": "category",
+ "label": "Writing Programs",
+ "items": [
+ "writing-programs/basics",
+ "writing-programs/compiling",
+ "writing-programs/cycle-tracking",
+ "writing-programs/inputs-and-outputs",
+ "writing-programs/patched-crates",
+ "writing-programs/precompiles",
+ "writing-programs/proof-aggregation",
+ "writing-programs/setup"
+ ],
+ "collapsed": true
+ },
+ {
+ "type": "category",
+ "label": "Generating Proofs",
+ "items": [
+ "generating-proofs/basics",
+ "generating-proofs/setup",
+ "generating-proofs/proof-types",
+ "generating-proofs/recommended-workflow",
+ "generating-proofs/sp1-sdk-faq",
+ {
+ "type": "category",
+ "label": "Hardware Acceleration",
+ "link": {
+ "type": "doc",
+ "id": "generating-proofs/hardware-acceleration"
+ },
+ "items": [
+ "generating-proofs/hardware-acceleration",
+ "generating-proofs/hardware-acceleration/avx",
+ "generating-proofs/hardware-acceleration/cuda"
+ ]
+ },
+ {
+ "type": "category",
+ "label": "Prover Network",
+ "link": {
+ "type": "doc",
+ "id": "generating-proofs/prover-network"
+ },
+ "items": [
+ "generating-proofs/prover-network/key-setup",
+ "generating-proofs/prover-network/usage",
+ "generating-proofs/prover-network/versions"
+ ]
+ },
+ "generating-proofs/advanced"
+ ],
+ "collapsed": true
+ },
+ {
+ "type": "category",
+ "label": "Verification",
+ "items": [
+ "verification/off-chain-verification",
+ {
+ "type": "category",
+ "label": "On-Chain Verification",
+ "items": [
+ "verification/onchain/getting-started",
+ "verification/onchain/contract-addresses",
+ "verification/onchain/solidity-sdk"
+ ]
+ }
+ ]
+ },
+ {
+ "type": "category",
+ "label": "Developers",
+ "items": [
+ "developers/common-issues",
+ "developers/usage-in-ci",
+ "developers/building-circuit-artifacts",
+ "developers/rv32im-specification"
+ ]
+ },
+ "what-is-a-zkvm",
+ "why-use-sp1"
+ ]
+}
diff --git a/book/versions.json b/book/versions.json
new file mode 100644
index 0000000000..af427f44cc
--- /dev/null
+++ b/book/versions.json
@@ -0,0 +1,3 @@
+[
+ "3.4.0"
+]
diff --git a/examples/elf/riscv32im-succinct-zkvm-elf b/examples/elf/riscv32im-succinct-zkvm-elf
index dbd4cfab99..0ccb13dc62 100755
Binary files a/examples/elf/riscv32im-succinct-zkvm-elf and b/examples/elf/riscv32im-succinct-zkvm-elf differ