Binance Square

vitalik.eth

0 Suivis
1 Abonnés
2 J’aime
0 Partagé(s)
Tout le contenu
--
Nordics are walking back the cashless society initiative because their centralized implementation of the concept is too fragile. Cash turns out necessary as a backup. Ethereum needs to be resilient enough, and private enough, to be able to credibly play this kind of role.
Nordics are walking back the cashless society initiative because their centralized implementation of the concept is too fragile. Cash turns out necessary as a backup.

Ethereum needs to be resilient enough, and private enough, to be able to credibly play this kind of role.
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
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
How to make Ethereum L1 scaling more friendly to users running local nodes for personal use: https://ethresear.ch/t/a-local-node-favoring-delta-to-the-scaling-roadmap/22368
How to make Ethereum L1 scaling more friendly to users running local nodes for personal use:

https://ethresear.ch/t/a-local-node-favoring-delta-to-the-scaling-roadmap/22368
Simplifying the L1 https://vitalik.eth.limo/general/2025/05/03/simplel1.html
Simplifying the L1

https://vitalik.eth.limo/general/2025/05/03/simplel1.html
Connectez-vous pour découvrir d’autres contenus
Découvrez les dernières actus sur les cryptos
⚡️ Prenez part aux dernières discussions sur les cryptos
💬 Interagissez avec vos créateur(trice)s préféré(e)s
👍 Profitez du contenu qui vous intéresse
Adresse e-mail/Nº de téléphone

Dernières actualités

--
Voir plus
Plan du site
Préférences en matière de cookies
CGU de la plateforme