Vitalik Buterin
@vitalik.eth
Grats @dankrad @karalabe.eth you got me to interrupt my work on EIPs and make a twitter response that turned into an unscheduled poast 😀 https://vitalik.eth.limo/general/2024/05/17/decentralization.html
52 replies
133 recasts
725 reactions
Péter Szilágyi
@karalabe.eth
Thanks. In exchange let meg interrupt my shit-posting to write an EIP (brain-dump) :) https://x.com/peter_szilagyi/status/1791589527452336341
2 replies
0 recast
8 reactions
Vitalik Buterin
@vitalik.eth
It's an interesting proposal! I think the biggest challenge with this kind of approach is intentional "edge attacks" to try to split the network. So, suppose you have X+1 proposer slots in a row. You send a tx right on a slot boundary, and don't include it X+1 times. Half the network thinks your last block is censoring
4 replies
1 recast
3 reactions
Péter Szilágyi
@karalabe.eth
I'm unsure this is an attack though. If I am a malicious validator that try to mess with my own block, I could try and time the propagation to split the network, but the effect is that my block might get reorged out f 50%+ don't attest. If 50%+ does attest, the block remains. But I don't see a split here. 1/2
2 replies
0 recast
1 reaction
Vitalik Buterin
@vitalik.eth
OK I thought about it more, and I think you're right; if it's a fork choice penalty, and not a validity rule, and there's an eventual convergence guarantee, then it seems like it could work. The main risk I see is accidental mempool splitting; the mempool contains lots of objects and if you disagree even on one...
2 replies
0 recast
3 reactions
Péter Szilágyi
@karalabe.eth
That's why the "mandated" transaction set would only be a subset of the pool. Should be a subset that we'd be confident enough that is "stable" across peers. Need to think about what would make a reliable set where small dissonances aren't a relevant issue.
1 reply
0 recast
2 reactions
ensgiant.eth 🎩 🆓
@ensgiant.eth
Please buy this Iconic ENS name @vitalik.eth
0 reply
0 recast
0 reaction
