network privacy and mixnet §
research §
development §
- Refined Mixnet specs: Decided to use libp2p even for direct QUIC connections for v1, so that we can use peer discovery and NAT traversal later on; Defined an initial approach to report on unresponsive mix nodes, though it should be improved later; Simplified the specification of using Sphinx packets, by abstracting the internal Sphinx spec ;Updated the calculation of
lambda and mu by suggesting a refined approach of emission rates; Decided to start with only mixnode-defined delays.
- Three quarters of mixnet python specification code has been done; since it has been decided to move Sphinx out of the mixnet specs(see comments) - it will be moved to a new repo in order to be utilized properly; the basic structure and topology construction and Sphinx packet builder have also been added.
- Research of QUIC and QUIC connections - what is available and what is the difference from the TCP connections
testnet §
development §
- Initial node metrics PR has been merged - to reiterate, this will add metrics service + initial metrics for CL and DA mempools. We will continue the effort to collect data about other services in the coming weeks.
cryptarchia §
research §
- The Private Proof of Stake milestone has been renamed to Cryptarchia in order to better reflect current work.
- Updated the living document that showcases if the leader election function leads to wealth concentration - more precisely the stochastic fork choice rule - which seems to ignore the validator stake.
- [Analysis](https://www.overleaf.com/read/fzbrxvkwwscq#f2907c](https://www.overleaf.com/read/fzbrxvkwwscq#f2907c) of total stake inference problem: For the statistical estimator of the total stake D, the results of a large stake expansion were used to derive Gaussian approximation for the distribution of
D. The latter was used to define “confidence” and “accuracy”. The large stake expansion was used to study other important properties, such as convergence rate of inference algorithm, and provides a relatively simple and compact set of relations between different parameters, such as number of nodes N, learning rate h, number of epochs T, stake mean and stake variance
- We were able to answer most of the open questions (from previous weekly - remaining is analytical grounds for fast convergence) - How big should
T be (# of slots in an epoch), How small should h be , How fast does this converge.
- We have a general solution to the total stake inference problem - based on this document we have a good understanding of Accuracy, Convergence Rate and Stability.
- Writing of the Cryptarchia specification is well underway - you can check the latest version here.
- Reviewed Ouroboros Praos, the focus was to understand the whole design and put a bit more attention at the design of the random beacon and some security assumptions. More on that in the notes.
development §
- The Cryptarchia development plan initially stated is still valid and has been updated. We will have the first milestone defined soon as well.
- Refactor consensus engine in preparation for adding a new consensus - PR.
data availability §
research §
development §
- Merged a couple of small fixes for the nomos-chat app - more details here.
miscellaneous §
- 3 interrelated topics that have the potential to create an interesting element of differentiation have been researched: turning Execution Zones into Plasma chains with ZK proofs (findings), solutions for instant deposit/withdrawal, solutions for ZK-bridging with the Base Layer (basically the CL layer, but as minimal as possible).
- Polygon Avail has been researched - findings.
- Simulations working principle (the Carnot paper Appendix) has been added.
- Whitepaper feedback review in progress.
- Carnot paper has been reviewed.