Nomos update june 10 2023 (#74)

* Create 2024-06-10.md

* Update 2024-06-10.md

content/nomos/updates/2024-06-10.md

@@ -0,0 +1,80 @@
+---
+title: 2024-06-10 Nomos weekly
+tags:
+  - nomos-updates
+date: 2024-06-10
+lastmod: 2024-06-10
+draft: false
+description: Weekly update of Nomos
+---
+## `P2P Privacy`
+
+### `Research`
+
+- Mixnet v2 Simulation: invested time to improve/simplify the passive adversary attacks before running simulations with various parameter sets. Also running the passive adversary simulation with various parameter sets to find the optimal parameters/designs (the result is not posted in Notion yet).
+- Introduced an attack that monitors nodes which emit messages at promised timing (i.e., block interval). The description can be found [here](https://www.notion.so/WIP-P2P-Privacy-Passive-Adversary-ecbcb7ea509b4337b66de515d900dd50?pvs=4#94509eb14e744ab1be551f42ae60d172). This attack is expected to be disrupted by adding cover traffic. The confirmation of this will come once we run the attack with different cover traffic parameters.
+- Optimized the timing attack (tracing back message paths) and quantified its result, as posted [here](https://www.notion.so/WIP-P2P-Privacy-Passive-Adversary-ecbcb7ea509b4337b66de515d900dd50?pvs=4#4d6fe409034740a1a91b47f0833214fb). The confirmation of this will come once we run this simulation with different parameters (number of layers and delays).
+- For the analysis of the mix gadget, we have followed the “conventional” mix model research path: considering the most general scenario when n nodes sample k paths from the set of all nodes in the network [N]. We assumed that each node samples \( r \) of such \( k \) paths. We have shown that a node in a \( k \)-path is also participating in other \( r - 1 + c_i \) \( k \)-paths. Here \( c_i \) is a random variable from the binomial distribution with parameters \( rn \) and \( \frac{k}{N} \). For \( k \ll N \) and \( N \) large, \( c_i \) is a random variable from the Poisson distribution with parameter \( \frac{k r n}{N} \). On average, a node is participating in \( \frac{k r n}{N} + r \) \( k \)-paths. We calculated an upper bound on the probability that node connectivity deviates from this average by the amount of ϵ\epsilonϵ. The summary can be found [here](https://www.notion.so/Analysis-of-the-mix-gadget-6246ab47a8e34ac0bc7b561d32680e34?pvs=4#82bbd1c88f344e85ba430eacbdc03b5c).
+
+### `Development`
+
+- No updates this week.
+
+## `Data Availability`
+
+### `Research`
+
+- Finished the benchmark document and all results are documented [here](https://www.notion.so/Benchmark-and-Scheme-Viability-Analysis-ce94c6a6cb2c4661bca3bacfdf88e048). We will continue with NomosDA.
+- We were having an issue with the roots of unity that didn't allow us to use FFTs. After an org-internal talk, we solved the issue, and now it is working (the problem was that we were using the wrong generator that worked for everything except the FFTs).
+- Started implementing FFT in specs as it is highly needed for FK20.
+
+### `Development`
+
+- No updates this week.
+
+## `PPoS/Consensus`
+
+### `Research`
+
+- Improved the results in the [wealth concentration document](https://www.notion.so/Does-Crypsinous-Leader-Election-Function-lead-to-wealth-concentration-in-PoS-b81f07a791b745438443f51f00ac258f).
+
+### `Development`
+
+- No updates this week.
+
+## `Coordination Layer`
+
+### `Research`
+
+- Started to review the Plonky3 details (the [notes](https://www.notion.so/Plonky3-14b458697981418185fdfcd5c358ac8b) can be found here). Generally, we can say it's an improved version of Plonky2 in terms of prover time - meaning we can use it in situations where we need more efficient prover time. Initially, it was more appropriate to use Plonky2 because Plonky3 was still in development, but considering that Risc0 and Succinct have also started using it, we can consider using the Plonky3 protocol as well. In any case, it has advantages over Plonky2.
+- On the other hand, we haven't found any disadvantages in Plonky3. We thought proof size might be an issue, but they mentioned that they could reduce the proof size using recursion. In this case, it seems logical to use it for inner proof, but the details need to be examined. Perhaps conducting a similar benchmark study for inner and outer proofs as we did for DA would be beneficial.
+- After discussing the CL Architecture, the most recent design making use of message buffers is now described here: [CL Architecture](https://www.notion.so/Coordination-Layer-Architecture-a2a0786a9a95402fb7365c087487cb6b?pvs=4).
+- After making the decision to rewrite the CL spec in Rust due to the lack of crypto libraries in Python, we decided to halt the spec work in favor of the CL architecture design work that was more pressing.
+
+### `Development`
+
+- No updates this week.
+
+## `Testnet + Insights`
+
+### `Research`
+
+- Finished base insights structure [document](https://www.notion.so/Nomos-node-insights-bcbbb72ece654720a65d4aa724150757) (after discussion) - for the time being though, since it's probably going to be a living document.
+
+### `Development`
+
+- (WIP) Tested our GELF tracing subscriber and connected it to Graylog in the testnet: subscriber is implemented and sends logs to the provided Graylog endpoint. However, the Graylog instance is spawned in the testnet, but manual steps need to be taken during every redeployment, which is not acceptable.
+
+## `User Tools`
+
+### `Research`
+
+- No updates this week.
+
+### `Development`
+
+- No updates this week.
+
+## `Miscellaneous`
+
+- No updates this week.