You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Sep 10, 2025. It is now read-only.
\* Since Arbitrum is a rollup, L1 blocks are part of its consensus, so trustless syncing is technically feasible. However, neither L1 block hashes nor L1 beacon block roots are currently exposed in a way that smart contracts can consume.
Copy file name to clipboardExpand all lines: docs/pages/references.mdx
+1Lines changed: 1 addition & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -26,5 +26,6 @@ title: References
26
26
*[Vortex: A List Polynomial Commitment and its Application to Arguments of Knowledge](https://eprint.iacr.org/2024/185), by Alexandre Belling, Azam Soleimanian, and Bogdan Ursu of Linea
The Testnet Beta (v0.0.2) release of Keyspace introduces [`keyspace-client`](https://github.com/base-org/keyspace-client/tree/v0.0.2), an example TypeScript client for Keyspace with an integrated smart wallet, and [`keyspace-recovery-service`](https://github.com/base-org/keyspace-recovery-service/tree/v0.0.2), an RPC service for generating SNARK proofs of the signatures users sign to change their keys. The supported chains have been expanded from Base Sepolia and Optimism Sepolia to include Arbitrum Sepolia, Gnosis Chiado, Polygon Amoy, BSC Testnet, and Avalanche Fuji.
12
+
13
+
## Testnet Alpha (v0.0.1)
14
+
15
+
*March 29, 2024*
16
+
17
+
Initial preview release of Keyspace, including a running Keyspace sequencer and [an example Go client](https://github.com/base-org/keyspace-example) for Keyspace's RPC calls.
Copy file name to clipboardExpand all lines: docs/pages/roadmap.mdx
+7-5Lines changed: 7 additions & 5 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -37,17 +37,19 @@ Currently, `Account` circuits are only designed to manage the key configuration
37
37
38
38
### Optimize Recursive Circuits
39
39
40
-
It currently costs 330,000 gas to verify a single key recovery proof vs the ~80,000 gas cost of just writing keys directly to L1. The proofs can batch multiple recoveries, and we expect that more recoveries in a single would have a sublinear increase to the gas cost. But in practice, we don't expect to be able to batch many recoveries soon: there seem to be ~100 recoveries per day for Safe wallets on mainnet after five years of adoption.
40
+
Recovery proofs currently take five to ten minutes to generate, but recent improvements in proving systems offer 30x-100x increases in speed.
41
41
42
-
We aim to make two optimizations to our circuits:
42
+
We aim to explore two paths for optimizing our circuits:
43
43
44
-
1.Use gnark's AssertDifferentProofs to get us down to a single pairing at the end of the recurse circuit.
45
-
2.Convert the inner proofs to use Vortex, plonky2, or STARK-in-SNARK.
44
+
1.Convert the inner proofs to use Vortex, plonky2, plonky3, or STARK-in-SNARK.
45
+
2.Use gnark's AssertDifferentProofs to get us down to a single pairing at the end of the recurse circuit.
46
46
47
47
### Aggregate Config Proofs via ERC 4337 Aggregators
48
48
49
49
Aggregators in ERC 4337 were designed to allow BLS signatures to be aggregated, which saves on data availability costs. We can repurpose this feature for aggregating Keyspace configuration proofs. A single SNARK can prove the current configuration for many wallets, which could help us get the per-transaction gas costs down from 365,000 ($0.11) to less than a cent. (BLS signature aggregation is also being explored as an L2-specific transaction type, and this may be another avenue for aggregating configuration proofs.)
50
50
51
51
### Make Keyspace an L3
52
52
53
-
It costs 330,000 gas for the sequencer to verify proofs on L1, which makes the expected cost per key change fairly high. It would be cheaper to settle on a [minimal L2](https://vitalik.eth.limo/general/2022/09/17/layer_3.html#rollups-and-validiums-have-a-confirmation-time-vs-fixed-cost-tradeoff.-layer-3s-can-help-fix-this.-but-what-else-can) designed just for ZK systems to aggregate their proofs and update their state on L1.
53
+
It currently costs 330,000 gas to verify a single key recovery proof vs the ~80,000 gas cost of just writing keys directly to L1. The proofs can batch multiple recoveries, and we expect that more recoveries in a single would have a sublinear increase to the gas cost. But in practice, we don't expect to be able to batch many recoveries soon: there seem to be ~100 recoveries per day for Safe wallets on mainnet after five years of adoption.
54
+
55
+
It would be cheaper to settle on a [minimal L2](https://vitalik.eth.limo/general/2022/09/17/layer_3.html#rollups-and-validiums-have-a-confirmation-time-vs-fixed-cost-tradeoff.-layer-3s-can-help-fix-this.-but-what-else-can) designed just for ZK systems to aggregate their proofs and update their state on L1.
0 commit comments