P2P Privacy §
Research §
- Rewrote the Queue Mechanism Simulations in Rust to make them much faster even with heavy parameters. This version does not use any bloated simulation framework (previously used in Python) and contains only the core logic we want to test. Result: more than 5x faster than the Python version. This is in the git branch, as a PR hasn’t been opened yet. The entire Mixnet Workgroup will review the new code this week.
- Added additional experiments: Experiment 5 and Session 3.
- Added additional queue mechanisms: NoisyCoinFlippingRandomRelease has been added. Two other additional mechanisms will be added this week.
- Planning the set of experiments that we need to run for the next iteration and decided to improve the way we are scheduling them and keeping track of them.
- Made small tweaks to the parameters set for the sessions 2-4 - decided to use a fixed transmission rate as it does not impact the results of our simulations and reduces the number of experiment cases by 2/3.
- Considered a node sending a message to all N−1 nodes of the random network: a message traveling from a node to its neighbour is delayed by the amount of time spent in the out-queue + the connection link latency. Assuming that the random network is locally tree-like, which includes networks prescribed by distributions of node connectivities, the time to deliver a message to all N−1 nodes is equal to the maximum delay over all paths from the sending node to a receiving node. For a node sending a message to its neighbours, calculated the distribution of the maximum delay. The summary can be found here. Analysis of a message sent from a node in a random regular graph is currently in progress.
Development §
Data Availability §
Research §
Development §
- PR #689 - finished implementing/fixing the DA network sampling layer. Had to rewrite a significant portion of it as the underlying protocol didn’t work as expected.
- PR #690 - DA Mock network service for CLI app: implemented dispersal of kzgrs encoded data using DA network service with a mock backend (same service will be used with the libp2p backend that will be worked on this week).
PPoS/Consensus §
Research §
- Developing the code to study the selfish behavior of stakers (within the wealth concentration context).
- Conducted more statistical analysis of the “follow the protocol” study.
Development §
Coordination Layer §
Research §
- Benchmark results for zkVMs have been updated, and additions have been made to the ZkVM document on Notion.
- While working on OlaVM, discovered they are working on Brakedown PCS to speed up proof generation in the future. An explanation about Brakedown has been added to the proof survey document. It also appears to be compatible with Plonky3. Relevant developments will be monitored.
- Published the report on the results of the atomic transfer PoC.
- Published a writeup on Permissionless Notes. This resolves some of the problems we had with how adversaries had control over nullifiers which could lead to nullifier collisions and unspendable notes. (An adversary could engineer a note that had the same nullifier as a zone note and could make the zone note unspendable).
- PR #27 (PoCs) - implemented collision-resistant nullifier idea from the permissionless note writeup.
- PR #28 (PoCs) - implemented nonce evolution ideas from the permissionless note writeup.
- PR #29 (PoCs) - implemented in-zone signature verification (adds 60s to atomic transfer scenario time). This gets out the PoC to a realistic enough scenario that we can start optimizing.
- Published several documents as solutions for Immediate Zone Data Availability and for the issues derived from our long finality times: Timely Data Retrieval for Permissionless Executors and Zones, Finality, and Preconfirmations. These topics might require more work, especially as we discuss them and see what impact they bring to the current design.
Development §
Testnet + Insights §
Development §
Research §
Development §
Miscellaneous §