PQ provers for P2PKH outputs

The concept discussed revolves around the creation of a registry mechanism that effectively combines traditional cryptographic practices with post-quantum (PQ) cryptography. This innovative approach aims to enhance security measures for digital transactions, addressing potential vulnerabilities exposed by quantum computing advancements.

At the core of this system, users are tasked with generating a new set of PQ keys for various PQ signature algorithms, such as $\mathsf{SLH\text{-}DSA}$ and $\mathsf{ML\text{-}DSA}$. These keys are utilized to form a unique message, which incorporates a hash function ($\mathcal{H}_{sha256}$) alongside a specific transaction identifier and an index. The message is then signed using the ECDSA key associated with a P2PKH address, establishing a verifiable link between the user's traditional and PQ cryptographic identities.

Furthermore, the process involves creating a proof ($\pi_{\mathsf{p2pkh}}$) that validates the relationship between the P2PKH address and the newly generated PQ keys. This proof contains two critical components: the verification of the ECDSA signature over the secp256k1 curve and the SHA-256 hash of the public key. Notably, while the mechanism could theoretically incorporate additional hashing algorithms, such as RIPEMD-160, within its circuits, the decision was made to simplify the proving process and keep the ripemd-160(.) calculation transparent and outside the proof's scope.

To ensure long-term verifiability and prevent potential timestamp fraud, the system proposes leveraging a secure timestamping service, such as Opentimestamps. By committing both the message and its corresponding proof before a predetermined date (referred to as day Q), users can reliably demonstrate the linkage between their P2PKH address and PQ keys at any future point. This foresighted approach underscores the importance of adaptability in cryptographic practices, especially in anticipation of quantum computing developments that may challenge existing security frameworks.