Hi Boris,
> To Peter: rather than trying to "defeat ZKP," maybe the pragmatic path
is to shape any ZK/succinctness work so that the design itself carries
the necessary data (e.g., preimages must be published on-chain and
retrievable) and ships with strong data-availability guarantees (so
raw tx/block data stays broadly accessible, not just proofs). If the
"good" ZK system makes data availability a built-in feature, it can
occupy the niche and leave less room for alternative designs that drop
those guarantees.
re: "a good ZK system makes data availability a built-in feature", I think this concept of "good" is not very relevant if it's counter to incentives (hence my earlier "Hmm" comment; incentives matter).
Meanwhile I find myself reflecting more on Peter's original point (how spectacularly deleterious to mining this could be, let alone the data availability stuff), and I'm wondering if we can just go radically in the opposite direction: what if mining was done just on an accumulator over the utxo set, instead of the utxo set itself? Complete redesign of the protocol, but .. possible, I think? Tx inputs would have to have set membership proofs. I wonder if anyone's done this particular analysis.
Cheers,
waxwing/AdamISZ
On Monday, December 8, 2025 at 2:59:14 PM UTC-3 Nagaev Boris wrote:
Hi waxwing/ AdamISZ,
Peter's main concern is that ZKP-only validation can break HTLCs: if a
spend is proven valid with a ZK proof but the actual transaction data
(including the preimage) never needs to be revealed on-chain, the HTLC
payer (the counterparty relying on that preimage) can't learn it and
can't claim its incoming HTLC. That undermines Lightning's security
because "proof of publication" collapses into "proof of validity
without data availability." Any succinctness/ZK approach for Bitcoin
has to preserve the guarantee that the preimage is actually published
and readable.
Related, if the network drifts toward relying on ZK proofs without
simultaneously guaranteeing open access to raw blocks and
transactions, block data can become gated by a few data providers.
That is a data-availability risk that comes with any ZK deployment
that omits strong DA, and it would erode self-sovereignty for routing
nodes. Any practical ZK/succinctness design for Bitcoin needs strong
data availability, so anyone can fetch raw transactions, not just
validity proofs.
To Peter: rather than trying to "defeat ZKP," maybe the pragmatic path
is to shape any ZK/succinctness work so that the design itself carries
the necessary data (e.g., preimages must be published on-chain and
retrievable) and ships with strong data-availability guarantees (so
raw tx/block data stays broadly accessible, not just proofs). If the
"good" ZK system makes data availability a built-in feature, it can
occupy the niche and leave less room for alternative designs that drop
those guarantees.
Best,
Boris
On Tue, Dec 2, 2025 at 10:05 AM waxwing/ AdamISZ <ekag...@gmail.com> wrote:
>
> (apologies to OP; we've drifted off topic here). Answers inline.
>
>
> On Monday, December 1, 2025 at 5:36:55 AM UTC-3 Peter Todd wrote:
>
> On Sat, Nov 29, 2025 at 05:54:13AM -0800, waxwing/ AdamISZ wrote:
> > Hi Peter, list,
> >
> > Interesting!
> >
> > One thought that springs to mind: attempts to ameliorate IBD with ZKP
> > should not forget one thing: what we actually want here is succinctness,
> > and not so much ZK. Think SNARK instead of ZkSNARK.
> > Which is important; without the requirement for an actual ZK property for
> > the protocol, you can have it have attached witness that is not secret.
>
> The Zero-Knowledge part is important to the goal in this specific use-case:
> trying to prevent all arbitrary data publication.
>
>
> Yes agreed. (with the strange caveat: the ZK property itself allows data-embedding almost by force; the reason Schnorr has a data embedding channel and BLS does not is precisely that BLS does not have a ZK property, which itself relates to the fact that it's deterministic (think: no nonce = no channel) .. the caveat is not super relevant to some kind of ZK-ed IBD thing, though, since that's compressing an unfathomable amount).
>
> <snip>
>
>
> It's quite possible that ZKP's are, in the context of decentralized
> blockchains, an exploit that will prove to be impossible to patch. Similar to
> how merge mining is an economic exploit that may well be impossible to patch.
>
> Sometimes seemingly good ideas are ultimately killed by clever exploits.
>
>
> I have a sneaking suspicion you're wrong here, but I can't justify it. (Hence 'interesting!'). Would love to hear others opinion on the topic.
>
>
> > Take as contrast the opentimestamps model, where having proof
> > that something was published, is the main functionality offered/required.
>
> Nope. OpenTimestamps does not use proof of publication at all. OpenTimestamps
> is a commitment operation: proof that if A was changed, B would have to change
> too. The vast majority of OTS timestamps are for private data that is never
> published in any way. OTS simply shows that data *existed*.
>
> That seems like a good correction. So, tamper protection, using binding property of commitments .. and "proof of existence" is *one* possible function? Is that fair?
>
>
> > I
> > suppose there is another way to say it: the channel counterparty needs
> > "proof of future publication" in contract setup. That's fair enough but
> > it's a very different thing than getting a proof that something *was*
> > published.
>
> It is not a meaningfully different thing. An HTLC is proof that in the event of
> an uncooperative redemption, publication will happen. Slightly changing the
> time it takes is irrelevant to the general concept.
>
> Concretely: unless you can propose a technical innovation that somehow turns
> this pedantic nuance into a meaningfully different implementation, so what?
>
>
> On reflection I don't see it as strange to make the distinction between the two: 1/ proof that something was published in the past and 2/ proof that conditional on event X occurring, data Y will be published. I guess 1/ is just, most realistically, a case of publishing raw, unhashed data on a blockchain, then the proof that that event occurred in the past is the onchain txs ( using op_return or w/e) themselves. As you pointed out, that's not what OTS is doing. Nor is it what an HTLC is doing, that's 2/.
>
>
> --
> https://petertodd.org 'peter'[:-1]@petertodd.org
>
> --
> 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+...@googlegroups.com.
> To view this discussion visit https://groups.google.com/d/msgid/bitcoindev/91a40bf7-fe9e-43a1-85d1-5889d4b31a7fn%40googlegroups.com.
--
Best regards,
Boris Nagaev