This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
dido:public:ra:xapend:xapend.b_stds:defact:ethereum:eip:2929 [2022/05/21 14:28] nick |
dido:public:ra:xapend:xapend.b_stds:defact:ethereum:eip:2929 [2022/05/21 14:30] (current) nick |
||
|---|---|---|---|
| Line 54: | Line 54: | ||
| A secondary benefit of this EIP is that it also performs most of the work needed to make stateless witness sizes in Ethereum acceptable. Assuming a switch to binary tries, the theoretical maximum witness size not including code size (hence "most of the work" and not "all") would decrease from | A secondary benefit of this EIP is that it also performs most of the work needed to make stateless witness sizes in Ethereum acceptable. Assuming a switch to binary tries, the theoretical maximum witness size not including code size (hence "most of the work" and not "all") would decrease from | ||
| - | **''(12500000 gas limit) / (700 gas per BALANCE) * (800 witness bytes per BALANCE) ~= 14.3M bytes to 12500000 / 2600 * 800 ~= 3.85M bytes''**. Pricing for code access could be changed when code merklization is implemented. | + | **''(12500000 gas limit) / (700 gas per BALANCE) * (800 witness bytes per BALANCE) ~= 14.3M bytes''** to **''12500000 / 2600 * 800 ~= 3.85M bytes''**. Pricing for code access could be changed when code merklization is implemented. |
| - | In the further future, there are similar benefits in the case of SNARK/STARK witnesses. Recent numbers from Starkware suggest that they are able to prove 10000 Rescue hashes per second on a consumer desktop; assuming 25 hashes per Merkle branch, and a block full of state accesses, at present this would imply a witness would take 12500000 / 700 * 25 / 10000 ~= 44.64 seconds to generate, but after this EIP that would reduce to | + | In the further future, there are similar benefits in the case of SNARK/STARK witnesses. Recent numbers from Starkware suggest that they are able to prove 10000 Rescue hashes per second on a consumer desktop; assuming 25 hashes per Merkle branch, and a block full of state accesses, at present this would imply a witness would take **''12500000 / 700 * 25 / 10000 ~= 44.64 seconds''** to generate, but after this EIP that would reduce to |
| **''12500000 / 2500 * 25 / 10000 ~= 12.5 seconds''**, meaning that a single desktop computer would be able to generate witnesses on time under any conditions. Future gains in STARK proving could be spent on either | **''12500000 / 2500 * 25 / 10000 ~= 12.5 seconds''**, meaning that a single desktop computer would be able to generate witnesses on time under any conditions. Future gains in STARK proving could be spent on either | ||
| : (i) using a more expensive but robust hash function or | : (i) using a more expensive but robust hash function or | ||