6
votes
Accepted
Proof of inclusion inside a Block Header - State Root
The trie can be up to 64 levels deep. 1 for each hex character of a bytes32 hash. To find a piece of data, one must traverse 1 level at a time picking out the nth index of a (usually) 17 element array....
2
votes
Is there a method to prove that data has been fetched from a block on a blockchain?
If the requirement is without checking the Blockchain, the short answer is no.
When you say, to prove that data has been fetched from X, it means the information exists on X. And the Blockchain is the ...
2
votes
Is there a method to prove that data has been fetched from a block on a blockchain?
It's all about the context.
A block header contains various information. Proving that all of that is plausible in a given block requires that the previous block hash is also correct. So you need to be ...
2
votes
How do Merkle proofs prove the current balance of an Eth account?
You are correct, the key->value interface of the trie itself does not commit the balance, but there is an underlaying (also key->value based) DB that does.
When you lookup a key in the trie, it ...
1
vote
Accepted
Does Precompile Address Affect State Root?
The precompiled address seems to be in the op-stack technology stack. I am sure that there is no problem with your code, because I have tested your code on both the op test network and the mantle test ...
1
vote
Prove on L1 that an ERC20 transfer event happened on L2
There are two types of MPT proofs that can do this:
Using StorageRoot and Proof to prove the existence of transactions where L2 contract storage is changed: op-stack's L2ToL1MessagePasser contract, ...
1
vote
Is there a method to prove that data has been fetched from a block on a blockchain?
It sounds like you are describing a Merkle Tree. A Merkle Tree (singular version Merkle Proof) is a way of cryptographically proving that a piece (pieces) of data stored off chain is accurate and ...
1
vote
How do Merkle proofs prove the current balance of an Eth account?
And as usual, the answer is far closer when you ask your question publicly first. The proof actually contains the leaf node with the value you want to prove as its last stack entry. Here's a sample ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
proof × 14merkle-patricia-tries × 6
state-trie × 3
merkleization × 3
merkle × 3
solidity × 1
contract-development × 1
transactions × 1
json-rpc × 1
proof-of-stake × 1
light-clients × 1
proof-of-work × 1
calldata × 1
verify × 1
zksnark × 1
chaindata × 1
layer-2 × 1
state × 1
spv × 1
zokrates × 1
proof-of-existence × 1
sparse-markle-trees × 1
arbitrum × 1
l2 × 1
optimism × 1