logos-co
/
roadmap
mirror of https://github.com/logos-co/roadmap.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
roadmap/content/nomos/updates/2024-07-29.md

7.2 KiB
Raw Blame History

title tags date lastmod draft description project tracking
2024-07-29 Nomos weekly
nomos-updates
2024-07-29 2024-07-29 false Weekly update of Nomos https://www.notion.so/Project-Tracking-4fb69250b0114573a71c57882165eec3

P2P Privacy

Research

  • Ran the initial simulation to compare queuing mechanisms, but found that it's better to design a specifically targeted simulation (which focuses only on queuing mechanisms) instead of using the full-cycle simulation (which simulates the full features of the protocol).
  • We prepared the simulation strategy, and simplified the simulator according to the strategy (maximizing code reuse). The simulation results can be found in the Queuing Mechanism: Message Dissemination Time Experiments, though this report is not the final version. The result consists of the largest set of data (It took 48h+). More analysis needs to be done on the result data to make a decision on the queuing mechanism and recommended parameters. So far, we found that the Noisy Coin Flipping Queue shows the optimal dissemination time compared to other queuing mechanisms, but we don't want to jump to conclusions. Other aspects besides dissemination time need to be tested.
  • In the process of enabling better progress with simulations and analytical work, wrote a methodology document that will guide our efforts in understanding the queueing mechanism's impact on the network and its general properties.
  • Analysis of the queueing system in the Nomos Mixnet node: considered a message going through k nodes where the queuing system of each node delays the message. Assuming that a message is removed with probability q from the queue, the probability distribution of the total delay is the negative binomial. From this follows that the average total delay is \frac{k}{q}​. Calculated the upper bound on the probability that the total delay is greater than the average \frac{k}{q} by the factor 1 + \epsilon. The upper bound suggests that the mentioned probability is a monotonic decreasing function of k, q, and \epsilon. The aforementioned work is summarized in Notion.

Development

  • No updates this week.

Data Availability

Research

Development

  • PR #678 DA Protobufs: DA Prost integration merged - generates rust structures for protofiles as a build step.
  • PR #681 DA Protobufs: DA Network message types merged - Dispersal, Replication, and Sampling protocols defined as protofiles and exposed as a module in nomos-da/network/messages.
  • PR #679 CI Improvements - DA Indexer integration tests improvement merged - Integration test now better determines when to expect a specific blob_id in a block received via the network. This test will be used with the new DA dispersal protocol.
  • Researching attacks on DAS; understanding better the interactions between DAS and consensus, MEV, and the properties of our current design - summary.
  • PR #680 - started implementing DA network stack: sketched up crates, created basic structure for 3 subprotocols (dispersal, replication, sampling), implemented Replication subprotocol (non-working, we have a bug). Also added base contract for the DA networking layer on the nomos node. That way we can start integrating it into the DA services.
  • PR #683 - added DA network adapter trait in mempool (first step in adapting the mempool to continuously sample and verify).

PPoS/Consensus

Research

  • PR #10 - 1st Proof of Validator PR in Circom with Merkle tree.
  • Extended the Proof of Validator specification.
  • Continuation on reporting on studies 1 and 2 of the wealth concentration work (also redoing certain figures and improving the way results are compared) - results and report are getting in shape.
  • PR #9 - Proof of Leadership spec implementation in risc0.
  • Worked on the Caulk library to understand the details of the Caulk Rust implementation. There was an error when the prover was run multiple times during the proof verification process. This error was fixed. Additionally, benchmarked the proof and verification performances for different elliptic curves. The results are added to the spec document.

Development

  • No updates this week.

Coordination Layer

Research

  • The circuit design and details used in the Zcash spec were reviewed. Sprout and Sapling circuits are older designs. The Orchard circuit is the most current version, and its cryptographic structure is already the design we are using as a reference. Relevant notes were added to this document.
  • PR #8 - Nomos native zone deposit tx.
  • WIP: Nomos native zones bridge deposit.
  • PR #11 - added death constraints to the transfer scenario; in this scenario, we don't do any interesting account abstraction so the death constraints are proofs of no-ops. With this change, CL is "feature complete" for the purposes of the PoC.

Development

  • No updates this week.

Testnet + Insights

Development

  • PR #682 CI Improvements - Protoc build deps for testnet and Jenkins CI merged.
  • PR #684 Rust 1.80 (opened, not merged yet) - added an allow[dead_code] for Nonce in consensus for Clippy. Unused methods in da libp2p will be handled in separate PRs.

User Tools

Research

  • No updates this week.

Development

  • No updates this week.

Miscellaneous

  • No updates this week.