Currently if a given key has not been inserted in the trie, the proof generator throws, which makes sense for most use-cases. But there are use-cases for proving the absence of a node. A simple one would be in the context of a token transfer EE when no node has been added for the recipient. If there's no proof, EE can't be certain the recipient has no account, and additionally to add the account it needs the path to the root for that key.
Maybe we could just relax the keyvals in the proof to also include nulls.
Currently if a given key has not been inserted in the trie, the proof generator throws, which makes sense for most use-cases. But there are use-cases for proving the absence of a node. A simple one would be in the context of a token transfer EE when no node has been added for the recipient. If there's no proof, EE can't be certain the recipient has no account, and additionally to add the account it needs the path to the root for that key.
Maybe we could just relax the
keyvalsin the proof to also includenulls.