Somewhat, refer to https://en.wikipedia.org/wiki/Lamport_signature https://en.wikipedia.org/wiki/Lamport_signature as a starting point. The extension using Mer

Somewhat, refer to https://en.wikipedia.org/wiki/Lamport_signature https://en.wikipedia.org/wiki/Lamport_signature as a starting point. The extension using Merkle trees shows that you can open all of the on-bits in a message, where your public key is the Merkle tree root and your signature is the N authentication paths for all the 1s in the message bitstream, the average signature size will be `n/2 * log2(n) * n` bits. Of course this is fragile and the same public key (merkle tree root) cannot be used to open multiple messages - hence each signature includes the next public key and thus requires knowledge of the sequence/state of the signer which is not ideal and why Lamport signatures aren't really practical.