Currently, query positions are derived pseudo-randomly from roots of Merkle trees. Instead, we should derive them for root || nonce where nonce meets a configurable PoW parameter. This will improve proof security without increasing proof size.
Might make sense to do this after #1 is addressed.
Currently, query positions are derived pseudo-randomly from roots of Merkle trees. Instead, we should derive them for
root || noncewherenoncemeets a configurable PoW parameter. This will improve proof security without increasing proof size.Might make sense to do this after #1 is addressed.