A fun math aside, on the idea of splitting a large zk proving workload between multiple provers.
Suppose you have N provers, and you have a proving workload that you split into N parts (so, one part per prover). You require provers to pre-register, but registration is open-access.
Suppose you have a constant fault rate (eg. 1/5 of registered provers fail). Provers expect to complete in one round (eg. 3s). If one prover fails, other provers have to come in and re-prove that load. How many rounds does it take for the entire workload to get proven?
Answer: log*(N)
(yes, that's the iterated-log function)
Why:
In the first round, you go from N unproven workloads to N/5 unproven workloads
In the second round, each remaining workload gets assigned 5 provers, so per-workload failure rate becomes 1 in 5^5. So you go to N / 5 / 5^5 unproven workloads
In the third round, each remaining workload gets assigned ~5^5 provers, so failure rate is 1 in 5^(5^5). So you go to N / 5 / 5^5 / 5^(5^5) unproven workloads
10K FOLLOWER GIVEAWAY πππ
To celebrate 10K followers on Twitter, we're giving away 3x Raspberry Pi Foundation tote bags containing Raspberry Pi branded goodies π Winners will be randomly selected on Friday, 19 May 2023.
To enter: Follow us, like & RT this tweet.
Good luck!
@quorralyne Many legacy tools .NET Framework 4.5. For some scenario without network, I also needed to compile some tools in .NET Framework 2.0 π₯Ά (because on some test PCs no updates were installed). All the new tools I imposed .NET 6 when available π
Congratulations to the Ethereum Team, @VitalikButerin and everyone who worked on the merge to proof of stake last night! This move will reduce worldwide electricity consumption by more than .2%!
And we finalized!
Happy merge all. This is a big moment for the Ethereum ecosystem. Everyone who helped make the merge happen should feel very proud today.