Ansgar Dietrichs

We'll talk about state growth maybe towards the end.

But basically, you don't have to have a huge disk.

And then it leaves the third one, which is bandwidth.

And how do you actually keep scaling the chain now with the ZK system while actually keeping bandwidth requirements the same or even reducing them?

Well, that's yet another separate trick.

That's also, again, enabled by ZKVM, but it's separate.

And that is, you no longer actually need to download the full block.

And that makes sense, right?

Because you get the ZK proof, you have to download the proof, and the proof tells you, hey, assuming there is a block with this hash or something, once I apply the block, this is the result.

And that's proven.

So the only thing you need to know about the block is that it exists.

And that's a bit of a nuanced thing.

I mean, someone clearly must have created it, otherwise they could not have created the ZK proof.

So why do you have to verify that it exists?

Well, that's for the nuanced reason that you can otherwise withhold the data.

Like that's also the same for, that's why, for example, we even have blobs in the first place, actually for L2s is the same story.

You have to publish, you have to basically prove that the block was published so anyone can access it and anyone can get access to the transactions that were applied basically.

So, but what you can do is, I mean, that's again, where like the synergy with the L2s, it's just a beautiful story.

We've already built out specialized,

for verifying the existence of data very efficiently without downloading at all.