This allows for a highly advanced light client protocol that allows light clients to easily make and get verifiable answers to many kinds of queries: ... Does this account exist?
The is handled by the state tree, but the way that it is computed is more complex. Here, we need to construct what can be called a Merkle state transition proof. Essentially, it is a proof which make the claim “if you run transaction T on the state with root S, the result will be a state with root S', with log L and output O”
When we start using
parity we can create unlimited number of accounts each having an unique address ex:'
0xe427c111f968fe4ff6593a37454fdd9abf07c490'. As I understand if there is no transaction to this address, it will not show up on the state-tree.
[Q] If an account did not carried any transaction, hence it will now show up in the state tree. So how Ethereum could know that account actually exist which does now have any foot print on the state-tree?
[Q] In addition to that: hence each user can create unlimited number of accounts. If an user creates billions of accounts, and each will carry a non-stop transaction between each other. Does all account's information will be stored in the World-State? If yes, this may consume a lot of memory on the long run.
Thank you for your valuable time and help.