I believe I have found the solution to the open issue mentioned in the earlier email. It is just recursive 
verification. Instead of publishing each application circuit's verification key on-chain, we should have 
only one circuit that OP_ZKP will verify, which is a recursive verifier. 

Interested readers are welcome to visit the GitHub org dedicated for OP_ZKP: https://github.com/opzkp

So far I have just put up the high level ideas here: https://github.com/opzkp/tea-horse. There are nothing
else yet. But we will add stuff as we move on.

Regards,
Weiji

On Tuesday, July 23, 2024 at 8:40:08 AM UTC+8 Weiji Guo wrote:
Yes, that's true. With Dory we will have to work on some pairing-friendly curve. Not secp256k1.

On Tuesday, July 23, 2024 at 3:01:59 AM UTC+8 Weikeng Chen wrote:
I need to point out that Dory requires pairing, and therefore it cannot work with secp256k1?
Please circle back.
On Monday, July 22, 2024 at 9:16:18 AM UTC-5 Weiji Guo wrote:

———What-ifs———

What if the open issue cannot be resolved? We might consider Dory. It is 

transparent, requires pairing, and has logarithmic proof size but concretely larger 

--
You received this message because you are subscribed to the Google Groups "Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bitcoindev+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/bitcoindev/63186352-b441-4548-b7fa-8ff0d5f6fc97n%40googlegroups.com.