From mboxrd@z Thu Jan 1 00:00:00 1970 Delivery-date: Thu, 09 Apr 2026 14:56:16 -0700 Received: from mail-oa1-f59.google.com ([209.85.160.59]) by mail.fairlystable.org with esmtps (TLS1.3) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (Exim 4.94.2) (envelope-from ) id 1wAxMD-0003ww-Eq for bitcoindev@gnusha.org; Thu, 09 Apr 2026 14:56:16 -0700 Received: by mail-oa1-f59.google.com with SMTP id 586e51a60fabf-4236c3b8f32sf2849683fac.0 for ; Thu, 09 Apr 2026 14:56:12 -0700 (PDT) ARC-Seal: i=3; a=rsa-sha256; t=1775771767; cv=pass; d=google.com; s=arc-20240605; b=LfAsxXEt5tLI10oymQvW4Ws79PJZn0lE+0MRC+hhEp4p2/mk3qJmqYcUOf+6iIaStW 1ry4IzkIAMF+To1sxBrSaaGaIzh9pT6x7JC5VL3Rnx2EDppvvM29MkYwefPn9kGU3KW9 oiW8JFYKuqOvrrSlTnxOBci/AEEjiRYwPNrPx6cvDa/wl0kixCedY+E05e4CnRaCV/ZU PXQb19GclT0gI9FYqChJ4FVXBxBPvVjDG/ACU3mNeWrDTmQ1H5vJAayT0mLDtJsFODy1 Nw0+KeeHubzeU2khQhtpX7zTX+ULg6vVbHP+sPTRgEAMMSQnU4s9utwygr5z5yQDqBJ5 RE2Q== ARC-Message-Signature: i=3; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=arc-20240605; h=list-unsubscribe:list-subscribe:list-archive:list-help:list-post :list-id:mailing-list:precedence:cc:to:subject:message-id:date:from :in-reply-to:references:mime-version:sender:dkim-signature :dkim-signature; bh=P4BVW+Vo+/r+VhIILapcRNf8xIPTFH+1uvgIPvg64Bk=; fh=9vpdDiliSDyymLc3fHSJBY8+Jw71sJGzyvzJbNCCv9s=; b=UZtPKv9H1iKoCTqG5rZhlXrf69vi/u1mEQFleQnNzLBGv2au/CxxbtjkduHw66JPBW 2JyPkGUcTpMP/OZz7PMq91Wp1meArPUmoyH9EWuCmqCwfJkpGCyoulBqLPLOsv3F/G1o 8n8SIqgU9PraWmIE+utYEfLtIWSBw8+9rDY5yoAZb1+5DNRNF1AZHacuhmoM2MqqN8+9 1MxLLUBuUtzBcwXqzrFW0oWdiSWgrvKdGshKiVvh/axVjiPhEe/5UXQQh6WCmvzdpXnD p0+wVxQe1wZ1QY/4hhIICF4FRuzp62LwGexL/8cr51RebXtmgqAauvAcLTjheewkdp6l yrkQ==; darn=gnusha.org ARC-Authentication-Results: i=3; gmr-mx.google.com; dkim=pass header.i=@gmail.com header.s=20251104 header.b=TUryIIVF; arc=pass (i=1); spf=pass (google.com: domain of laolu32@gmail.com designates 2607:f8b0:4864:20::b132 as permitted sender) smtp.mailfrom=laolu32@gmail.com; dmarc=pass (p=NONE sp=QUARANTINE dis=NONE) header.from=gmail.com; dara=pass header.i=@googlegroups.com DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=20251104; t=1775771767; x=1776376567; darn=gnusha.org; h=list-unsubscribe:list-subscribe:list-archive:list-help:list-post :list-id:mailing-list:precedence:x-original-authentication-results :x-original-sender:cc:to:subject:message-id:date:from:in-reply-to :references:mime-version:sender:from:to:cc:subject:date:message-id :reply-to; bh=P4BVW+Vo+/r+VhIILapcRNf8xIPTFH+1uvgIPvg64Bk=; b=Vj4MfwMAiZwgoQUDlkeej8zPUiIp0qZQPsiJMG2VqeH59LnB6NzDy1K1hV7ZeGkHpF u3q0b1I2fex68En2h231Zn9FcFn5SXY1QTc9PdhMaoapdC+TIXgtGlU4HdvuzZjJ1s6r H/of8q8ZjbCU9j2NbSVXk9UfxigcNUqTYlD1usZvHsAbaEtOvCTb2MWg7odi39uNYofQ PPizm3PXR/6idOxLcBifncshDECJdhS2DcwlNA05K/9dAMpc7vscaAHXrLcFtOByVTnA nRSJ+e9jYZL8vhxt5jxNheCvltHpTj6P8JP9JNE3N8yABR25OpHbzYXwlhKpo13uvcsO tdWA== DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20251104; t=1775771767; x=1776376567; darn=gnusha.org; h=list-unsubscribe:list-subscribe:list-archive:list-help:list-post :list-id:mailing-list:precedence:x-original-authentication-results :x-original-sender:cc:to:subject:message-id:date:from:in-reply-to :references:mime-version:from:to:cc:subject:date:message-id:reply-to; bh=P4BVW+Vo+/r+VhIILapcRNf8xIPTFH+1uvgIPvg64Bk=; b=scLZkD8WkpnSUb5+QMYqqVHKcGSg1XUnDglsgcX+DcZW7Zkvmbm6J8rh68X1T6DiX5 DnlDek5yj1ytjmDupZLAch8PPX96BwialwTPSPWTLU6LQIicQOtR9+KCWqgkFRnBdwkm jfeDmoA5NOvurHN+E1x9WwUHDge7kzcOJiQP4G2fXCnEqR/vEjZRMaKqD2dEfEPmdyDk d9bOf9uek1W3Kx4lPdAK2uLrZoN2vUwbJq5LE4KqEXGkRXCFNbuaF2M73wc9ZiDMn1R/ zy5T24rbbPayBRgEaTgsaihwEo5XiS1dcImtP1ixu5mLPXH1jipK2HCrqjRxHjilLpwh NGNg== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20251104; t=1775771767; x=1776376567; h=list-unsubscribe:list-subscribe:list-archive:list-help:list-post :list-id:mailing-list:precedence:x-original-authentication-results :x-original-sender:cc:to:subject:message-id:date:from:in-reply-to :references:mime-version:x-gm-gg:x-beenthere:x-gm-message-state :sender:from:to:cc:subject:date:message-id:reply-to; bh=P4BVW+Vo+/r+VhIILapcRNf8xIPTFH+1uvgIPvg64Bk=; b=AXi2gPl1vlAKLbHd01yMVMUz3p7vZosRLoXGz0AVQcL/riQDmFkSrL0EdfUNgfl5ab 8HvuhwvOtWWE1y2yTr8LUA3GyH0O74tgqUY9+SrFRysiGAFyWkiW+0Q6sqV098vepL/n 99ut67s7qeEVnDFkeoXY0ri2EkDEK3K311Ttt3oMKVRw0hyLL5rWc+bxw4MNfeTWFzyG 3pUVe2WtA88FV0idZ5EmEFBN6woZWpkAbNoK24ZEWH9A4ps6IOJCPCzsWQJuZGxXR4yx bvbXOx0tJxJWTBcsOs9DRCipRvV4LIPKbXHegYO4s6LhjDp+yyALg8ByvOkDDEut4jIU uufg== Sender: bitcoindev@googlegroups.com X-Forwarded-Encrypted: i=3; AJvYcCW/2qgrNuhbY8TJvES6zzMZh5bMkewyLMw8f7uk4stKaGbxMA7j+mvTp3TSOh2Qn50L3uI+W141WGyh@gnusha.org X-Gm-Message-State: AOJu0YxeWZzq0uzGFRwSfKaYpl68HhAeomJ+PS8bP9y8jSITY+w6H74x t+kpe4pbKhFIVOxQw+IpkLZfrgnfJgN2np9or3FmTgz3O+9PH7uec5b0 X-Received: by 2002:a05:6870:2254:b0:414:625b:c376 with SMTP id 586e51a60fabf-423e1c6a260mr269885fac.8.1775771766880; Thu, 09 Apr 2026 14:56:06 -0700 (PDT) X-BeenThere: bitcoindev@googlegroups.com; h="AYAyTiLAUEsUz9LGua87j1Iyf3l2u9V/HqHBQkmSVi4DtivJJg==" Received: by 2002:a05:6871:2b02:b0:41c:3f51:3b83 with SMTP id 586e51a60fabf-4239e59ee2els891204fac.0.-pod-prod-00-us-canary; Thu, 09 Apr 2026 14:56:02 -0700 (PDT) X-Received: by 2002:a05:6808:13d5:b0:466:ed3f:7214 with SMTP id 5614622812f47-478b9f54edamr219668b6e.25.1775771762043; Thu, 09 Apr 2026 14:56:02 -0700 (PDT) Received: by 2002:a05:620a:7293:b0:8b2:e5d4:9264 with SMTP id af79cd13be357-8db3d124955ms85a; Thu, 9 Apr 2026 14:54:50 -0700 (PDT) X-Received: by 2002:ac8:5fc5:0:b0:50b:6d63:6a32 with SMTP id d75a77b69052e-50dd6b7a952mr7190781cf.20.1775771689223; Thu, 09 Apr 2026 14:54:49 -0700 (PDT) ARC-Seal: i=2; a=rsa-sha256; t=1775771689; cv=pass; d=google.com; s=arc-20240605; b=MHJnCkrEN8g6ssaVmwS9qG5gwzXMTP4f5yVUM5hJNkiF+8wFXsWwiHRviiPzbwHo0q l34g5qdhFACTs1m0gRfrzLqY7mTMVrWOmlwbfLzGu89UFFaxt8CPSY6yyqMVAdr4Z0Oo hTaloDdyK60oOw1PXzluC9TPozZLedXz/+BGgyE/ZwLqj1yrbOCBEv3jn2q6wXSu2Mwz jHJXy3UZgqNZ5whshNTyNk90B9P0f65bdLAiRMCds2GhybdaE+uyctBRefGao4OAX2Hr 5RMHY/Q5MqasE1o7OHF+GgwiD3kF7R6ma/1NDHYSWlFYmrbiiwTm7Wq1F9ddrKgwe8cG AF1A== ARC-Message-Signature: i=2; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=arc-20240605; h=cc:to:subject:message-id:date:from:in-reply-to:references :mime-version:dkim-signature; bh=ma81neXOsjUpbJXcbKHDMbNYEc14fbjSMn/3omL35dc=; fh=AraWG4EtKgnVZC3vx0kKXPCQKgjblcoyQOn27ZV865o=; b=LOL0SDY9dnzy8nu1DAsrGjIicpOYTsIv7lC3I47+1UF1SHhcN0Vypa83Y/cPbdizuy 4NQpW9dhJYL+MwBa2Hle0uhVoeD+zZ4AVPQV5/HPp1BUMsw7HxIgNwE32cm72zcnWNed fZJiKsJCQdQ9QFjkeGSPy9PSSVGo55vHnQXaD0xhRMeuMMebupPcrb/8OqA8PK25DvnO qgwg0dzn36jKHuDCtIxbfg+pQfsW2ehTRq1KybCCY/FBcijmfvlwoqY45XvbKo4rWErk htwxVQCIDMEFfAzS748EbtsLwbUUsWAjet4pYhmGmgi66csx7PTQeK8nnN6YekSAvNpi GsHg==; dara=google.com ARC-Authentication-Results: i=2; gmr-mx.google.com; dkim=pass header.i=@gmail.com header.s=20251104 header.b=TUryIIVF; arc=pass (i=1); spf=pass (google.com: domain of laolu32@gmail.com designates 2607:f8b0:4864:20::b132 as permitted sender) smtp.mailfrom=laolu32@gmail.com; dmarc=pass (p=NONE sp=QUARANTINE dis=NONE) header.from=gmail.com; dara=pass header.i=@googlegroups.com Received: from mail-yx1-xb132.google.com (mail-yx1-xb132.google.com. [2607:f8b0:4864:20::b132]) by gmr-mx.google.com with ESMTPS id d75a77b69052e-50dd5459ec3si282031cf.1.2026.04.09.14.54.49 for (version=TLS1_3 cipher=TLS_AES_128_GCM_SHA256 bits=128/128); Thu, 09 Apr 2026 14:54:49 -0700 (PDT) Received-SPF: pass (google.com: domain of laolu32@gmail.com designates 2607:f8b0:4864:20::b132 as permitted sender) client-ip=2607:f8b0:4864:20::b132; Received: by mail-yx1-xb132.google.com with SMTP id 956f58d0204a3-64edf260b49so2229320d50.0 for ; Thu, 09 Apr 2026 14:54:49 -0700 (PDT) ARC-Seal: i=1; a=rsa-sha256; t=1775771689; cv=none; d=google.com; s=arc-20240605; b=Db/pVtLFcSJ3TFlHmkIngX4njThAzsFSb5rAQ1leLxTZmVfxzXQfVxyJM5OZECpkmN cYdIj2u6seM6Kn+x2E5hXY46p+LMz3zD6/naQcAaO3PFUq4q7WFXKxAOUFjllPCqbLqq hhiv2dUGFvs4wG0GzmKvCokInfz0NjGRDgd102csuZ/1WK8SGBDUSVBi1RZI+gnR/shf f8wvxdHOXhcC996QgEGvIfZ0fqPCQbbF1SrQPSYv3Hi75OUKjZJSQkJMEjQule8vdeZf NKiZONuDigFcjXOCXTwnintyG3OCMFdzKYKDB4VW9PtZsS/h0oQjslLe8g3p4oAV8hDN 4IDw== ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=arc-20240605; h=cc:to:subject:message-id:date:from:in-reply-to:references :mime-version:dkim-signature; bh=ma81neXOsjUpbJXcbKHDMbNYEc14fbjSMn/3omL35dc=; fh=AraWG4EtKgnVZC3vx0kKXPCQKgjblcoyQOn27ZV865o=; b=X//a94pyaYUfkxdS4SeHHjYF40LphIT47IenfeV7edh/O5l67BZ/bQM8kCPWccyHOk +4KxE7eImcD7030FJ0K8OfBTbBJieNtq5Dlo6TCrRA5y/PIjUvw0lhvVmCPArxmgco6S Hu696nvqKGYZomrJWXIRSt9qjLOpjrdryZmxyYhcZQkxwsl4CHO/FzptO+XXXlGMp/2x fvI4O9mg0/a9B5SRHxEEZMpt65lvwe31GeBv5T6roP+p/7Bn5/xEO+HuMVdXfuBW/XkA 8JBGO9xqUWFI7PUFbRFcw9U7IB8YmvGYkB1Dy4H2rqBkOmGpVElqbJ3Hx3lVAXL5cMVn 2SUg==; dara=google.com ARC-Authentication-Results: i=1; mx.google.com; arc=none X-Gm-Gg: AeBDieswg7efLc8z/4T2kua41L3BWUDglIGu66C+97MkthfVkfc4AQAEcvpL2ANfG6q LBXba4P1xY6dRTATkMZ9p7fnk4wDVAMUhtR9Io9+5CfdaHuGTH9cuACtE/nHWUUraI48c/jJ7l/ 4w98PUNN0URr8qOUnYLqWc3EK6oZZj5uW41zYdf/bjp0M0h+r09IBYuObabj2FYj/4wfpinh9UX vM4d+q274OwXynIa2NKYGSAXFamR2z2BI+pQM4PFtRErpkQ6Vr6VtozjI6YzsErxKziYpoaNf05 vwsXyI+qyeCv9nldu3fWavwauhpJ+rb1fgWGEh+h X-Received: by 2002:a05:690e:d4c:b0:651:8944:c112 with SMTP id 956f58d0204a3-6518944e0ebmr3206765d50.23.1775771688512; Thu, 09 Apr 2026 14:54:48 -0700 (PDT) MIME-Version: 1.0 References: In-Reply-To: From: Olaoluwa Osuntokun Date: Thu, 9 Apr 2026 14:54:35 -0700 X-Gm-Features: AQROBzAuUW_B0CSRO1-OM3Bpt6f0teSyQ6KPEuSuh1pdDIE8XDKlopStDXpncVI Message-ID: Subject: Re: [bitcoindev] Post-Quantum BIP-86 Recovery via zk-STARK Proof of BIP-32 Seed Knowledge To: conduition Cc: Bitcoin Development Mailing List Content-Type: multipart/alternative; boundary="000000000000b22f29064f0e10a1" X-Original-Sender: laolu32@gmail.com X-Original-Authentication-Results: gmr-mx.google.com; dkim=pass header.i=@gmail.com header.s=20251104 header.b=TUryIIVF; arc=pass (i=1); spf=pass (google.com: domain of laolu32@gmail.com designates 2607:f8b0:4864:20::b132 as permitted sender) smtp.mailfrom=laolu32@gmail.com; dmarc=pass (p=NONE sp=QUARANTINE dis=NONE) header.from=gmail.com; dara=pass header.i=@googlegroups.com Precedence: list Mailing-list: list bitcoindev@googlegroups.com; contact bitcoindev+owners@googlegroups.com List-ID: X-Google-Group-Id: 786775582512 List-Post: , List-Help: , List-Archive: , List-Unsubscribe: , X-Spam-Score: -0.5 (/) --000000000000b22f29064f0e10a1 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Hi Condution, So I implemented both variants of your idea. My intuition was right in that it doesn't do much to reduce the size of the final succinct size, but the fina= l xpriv variant resulted in a significant reduction in both proving time, and also memory usage. I also re-ran the original succint proof for the origina= l Taproot claim and got a better value for the final proof time (def need a better benchmark env+set up!). Here's a breakdown of the resource requirements for the various proofs: * Full Taproot image ID: 8a6a2c27dd54d8fa0f99a332b57cb105f88472d977c84bfac077cbe70907a690 composite: seal 1797880 prove 49.32s verify 0.10s peak RSS 11907399680 succinct: seal 222668 prove 64.30s verify 0.03s peak RSS 11927207936 * Hardened xpub image ID: ad4ebc0ef6ce51e0f581cc8d14742a5b97738e9decd3fe2b0f1746de5bad9617 composite: seal 513680 prove 14.63s verify 0.04s peak RSS 11783503872 succinct: seal 222668 prove 17.29s verify 0.02s peak RSS 11782307840 * Hardened xpriv image ID: 8401a36e4f54cb2beaf9ac7677603806cf9d775e90ef5a70168045a3c0df0849 composite: seal 234568 prove 1.98s verify 0.02s peak RSS 3144171520 succinct: seal 222668 prove 2.84s verify 0.02s peak RSS 3145990144 So we can see that the succinct proof sizes are all about the same. However the xpriv variant can be proved directly in just 2 seconds on my machine! It also requires just 3 GB of memory for the proof as well. I've created some additional supporting documentation to detail exactly wha= t the new proofs do and their results: * https://github.com/Roasbeef/bip32-pq-zkp/blob/main/docs/reduced-variants.md * https://github.com/Roasbeef/bip32-pq-zkp/blob/1c89fdb398180a2b3eff7761b7f4b= 233d455c6c9/README.md#reduced-proof-variants * https://github.com/Roasbeef/bip32-pq-zkp/blob/438c548ca9b49d83ef4019974a517= 1f5e06fa840/docs/claim.md#reduced-variant-claims Once again, thanks for the great ideas! I wonder if we can improve on this round of proof golf further before reaching down a lower level with some sort of AIR compiler =F0=9F=A4=94. -- Laolu On Thu, Apr 9, 2026 at 1:53=E2=80=AFPM Olaoluwa Osuntokun wrote: > Hi Conduition, > > > You need only prove this much more general statement (2): "I know a BIP= 32 > > xpriv which derives this xpub via one or more hardened steps". > > > I'm amending my prior suggestion slightly: The circuit (guest program) > > could take in an xpriv (e.g. at m/86'/0') and output a child xpriv > > (e.g. at m/86'/0'/0') to the journal (instead of outputting a child > > xpub). > > That's an excellent insight! > > As mentioned in my recent reply, with risc0's "succinct" receipt type, I > was > able to get the proof size down to 220 KB, at the cost of 3.5x longer tot= al > proving time. > > Your proposal definitely reduces the complexity of the core statement to = be > proved, which would speed up the proving time for the normal > default/composite receipt type. > > I'll try to hack this up, and then run a head to head comparison to see > this > simpler statement actually results in a smaller proof then the final > succinct receipt of either of the proof variants. Based on my current > intuition w.r.t the lower level details, I think the final succinct proof > size would be on the same order of magnitude re size. > > However, this can still be a win as then this would provide potential > future > users with a less resource intensive proof, which can then be > aggregated/rolled up into a final succinct proof in a batched manner. > > This line of optimization is also more interesting if one were to look at > hand rolling a custom AIR to avoid the overhead that the RISC-V emulation > adds to the rirsc0 proof chain, given that it entirely skips doing any EC > operations at all for the final statement. > > ---- > > Re the commit/reveal approach, to be honest I'm not fully caught up on th= at > proposal. That original thread got pretty long, so I dropped of after a > point =F0=9F=98=85. I'll revisit that specific branch of the thread so I = can digest > it > and develop a proper opinion, then get back to you re comparisons! > > -- Laolu > > > On Wed, Apr 8, 2026 at 1:23=E2=80=AFPM conduition = wrote: > >> Oh, I've been a fool, a foolish fool. >> >> We don't even need to do point multiplication in the circuit at all. >> >> I'm amending my prior suggestion slightly: The circuit (guest program) >> could take in an xpriv (e.g. at m/86'/0'=E2=80=8B) and output a *child x= priv *(e.g. >> at m/86'/0'/0'=E2=80=8B) to the journal (instead of outputting a child *= xpub*). >> >> This is safe because remember, EC spending has been disabled in this >> context, and to a quantum attacker, an xpub is computationally equivalen= t >> to its xpriv. So why bother hiding it? The child xpriv doesn't give an >> observer anything they can't already do with the equivalent xpub. >> >> The guest program then is basically the BIP32 CKDpriv algorithm, >> restricted to a single hardened derivation step. The verifier gets the >> child xpriv, but can't use it to forge new proofs. Honest verifiers use = the >> xpriv to derive the child address(es) as suggested in my last message, t= o >> authenticate spending. >> >> Designing the guest program like this will massively reduce your circuit >> complexity, because EC point multiplication is *wayyyyy* harder for the >> RISC0 compiler to arithmetize than a simple hash function. In my prior >> work with RISC0 , I made a >> guest program which ran a SHA256 hash and an EC point multiplication. I >> found that pruning EC point arithmetic from my guest program improved >> prover runtime by a factor of over 100x. >> >> If I am not fever-dreaming and this is indeed possible, then the new >> circuit's complexity will be dominated not by point multiplication, but = by >> the HMAC-SHA512 call. Our new task is then to figure out how much we can >> internally optimize the HMAC-SHA512 call for STARK proving. Here's a few >> ideas. >> >> If you bust open HMAC-SHA512, it looks like this: >> >> HMAC_SHA512 =3D SHA512((K=E2=8A=950x5c) || SHA512((K=E2=8A=950x36) || ms= g))=E2=80=8B >> >> ...where in the context of BIP32 hardened CKD, the HMAC key K=E2=80=8B i= s the >> chaincode (padded with zeros to 128 bytes) and msg =3D (0x00 || sk || i)= is >> the parent secret key and child index. >> >> Since len(K) =3D 128=E2=80=8B is the SHA512=E2=80=8B block size, we need= a total of 4 >> SHA512 compression calls: >> >> 1. to compress (K=E2=8A=950x36)=E2=80=8B >> 2. to compress the msg=E2=80=8B (and SHA512 padding/length) >> 3. to compress (K=E2=8A=950x5c), and >> 4. a final compression call to tie it all together. >> >> >> The output of that last compression call is partitioned into the child >> chaincode, and a key delta which is added to the parent secret key (modu= lo >> the curve order), producing the child EC secret key. This last step is >> arithmetically simple; the SHA512 calls are where most of the arithmetic >> complexity lies. >> >> The question then becomes, which of these compression calls can be done >> outside the circuit, and which are truly essential for security? >> >> Note how the parent secret key is the most important piece for soundness= . >> The circuit needs to prove the parent secret key existed in the hash >> function preimage, and is correctly related to the child secret key via >> modular addition. So compression call (2) seems unavoidable. The others = are >> less rigid. >> >> I'd argue that if we really dig into the hard relation we're trying to >> prove here, we can reduce it to this statement: >> >> Given a child xpriv with secret key k=E2=80=8B, chaincode c=E2=80=8B and= index i=E2=80=8B, I >> know a preimage x*=E2=80=8B and secret key *sk=E2=80=8B such that: >> >> I <- SHA512( || SHA512( || 0x00 || sk || i)=E2=80= =8B) >> c =3D=3D I[:32]=E2=80=8B >> k =3D=3D int(I[32:]) + sk % n=E2=80=8B >> >> Seeing as the =E2=80=8B slots are arbitrary, and we know in B= IP32 >> they are always exactly one-block long, it seems easy to throw out the >> compression calls (1) and (3). The host can precompute the relevant SHA5= 12 >> midstates outside the circuit, and pass the midstates into the guest >> program as secret inputs. The tradeoff is that this permits malicious >> provers the flexibility of choosing their starting midstates (though has= h >> input length can be fixed at 192 bytes). I'm not entirely sure if this >> meaningfully weakens the verifier's soundness. Ethan Heilman might have >> opinions on this, he knows a lot more about attacking hash functions tha= n I >> do. Intuitively, I doubt sampling random SHA512 midstates is that much >> better than sampling a random HMAC key (chaincode) K=E2=80=8B and comput= ing the >> resulting midstates. >> >> This reduces our circuit to, i think, the minimum acceptable security >> floor for provers: two SHA512 compression calls, which commit to a paren= t >> secret key. >> >> >> regards, >> conduition >> On Wednesday, April 8th, 2026 at 12:09 PM, 'conduition' via Bitcoin >> Development Mailing List wrote: >> >> Hi Laolu, >> >> Great work getting this working in the real world. I've heard many peopl= e >> on delving and the mailing list conjecture based on this idea, but you'r= e >> the first person i've seen who's willing to put their money where their >> mouth is, and actually build a prototype. Bravo! >> >> It seems to me the circuit (guest program) could be simplified. Notice h= ow >> the guest code computes the entire HD wallet key path >> , >> including hardened *and *non-hardened derivation steps, and also >> computes the taproot output key with key-tweaking. I'd argue these steps >> are extraneous to the core hard relation you want the STARK to prove, an= d >> could be safely removed to reduce proof size and improve performance. >> >> In reality, you needn't go so far as to prove (1) *"I know a BIP39 seed >> which derives this taproot output key"*. You need only prove this much >> more general statement (2): *"I know a BIP32 xpriv which derives this >> xpub via one or more hardened steps"*. The latter statement (2) still >> cannot be forged by a quantum adversary even if they know your >> account-level xpub, but it entails far less computation to prove and >> verify. The rest of the original statement (1) can be done externally >> outside the circuit. >> >> Example. If i have a wallet with a taproot address at m/86'/0'/0'/1/2=E2= =80=8B, >> I could prove I know the xpriv at m/86'/0'=E2=80=8B which derives the xp= ub at >> m/86'/0'/0'=E2=80=8B. Then I provide the remaining key path elements /1/= 2=E2=80=8B in >> the witness. Note, i *do not* mean we *derive* the xpriv at m/86'/0'=E2= =80=8B >> inside the guest program. I mean the prover derives m/86'/0'=E2=80=8B fi= rst (in >> the host), and *then writes that xpriv into the guest program's inputs*.= The >> guest program derives and outputs the xpub at m/86'/0'/0'=E2=80=8B. The = verifier >> may check the STARK output (xpub) is correctly computed, then use the gi= ven >> key-path to manually derive the taproot address from the xpub themselves= , >> outside the circuit, and validate *that address* against the UTXO i'm >> spending. The verifier thus has confirmed the prover knew an xpriv which >> (through a hardened derivation step) derives the correct taproot output = key. >> >> This change significantly reduces the size of the circuit. From a glance= , >> I see the original guest program performs 6 HMAC-SHA512 calls (1 for the >> master key, 5 for the BIP32 derivation steps), two SHA256 compression ca= lls >> (for the taptweak hash), and two point multiplications. With this >> simplified variant, we are invoking only a single HMAC-SHA512 call and a >> single point multiplication. I can't say for sure, but I expect this wil= l >> improve your proof size and runtime significantly. >> >> This change also makes the circuit more generally applicable to other >> rescue contexts. For instance, it could be applied to BIP340 xonly keys >> inside a taproot script tree, or in a P2(W)SH address to an ECDSA public >> key, or to P2(W)PKH addresses. >> >> Concerned about publishing xpubs? Remember that we are assuming regular >> EC spending is locked in this context, so it is safe-ish to share accoun= t >> xpubs with quantum attackers. At best the xpub can be used for surveilla= nce >> but not forgery. If one would prefer not to share the account-level xpub >> on-chain for privacy reasons, the proof could be extended to also derive >> the unhardened child xpub at /1/2=E2=80=8B inside the guest program (but= we >> still do not need to do the taproot key tweaking in the guest program). >> >> We should also talk scaling efficiency. Given the cost of STARKs, this >> style of proof should be able to authorize spends for more than one UTXO= . >> Say you have a wallet with 10 different UTXOs held by distinct addresses= in >> the same BIP44 account. One single STARK proof could authorize spending = all >> 10 of them, by simply committing all 10 input signature hashes into the >> journal, and labeling the inputs with the corresponding 10 BIP32 key >> paths somehow. The verifier would need to check the proof only once and >> not 10 times. The 10 UTXO spends could be validated using the common xpu= b >> from the STARK proof's journal. >> >> For a slightly related work proving a similar relation for hashed >> addresses, using different STARK technology stacks, see this delving pos= t >> . >> >> However, all this said, my personal preference for long-term >> procrastinator rescue is still for commit/reveal strategies which prove >> essentially the same statement about BIP32 in a two-step procedure. They >> get the job done with much lighter cryptographic machinery and much smal= ler >> witnesses: a few hundred bytes over two transactions, compared to a few >> million bytes in one transaction with STARKs. Boris Nagaev and I >> discussed this on the list a while back >> . That said, >> commit/reveal requires more careful design and seems to demand the use o= f >> external quantum-safe coins to make the commitment in the first place, s= o >> perhaps the cost would be worth it to some people? IDK. What do you thin= k >> of commit/reveal compared to STARKs for this purpose? >> >> regards, >> conduition >> >> On Wednesday, April 8th, 2026 at 12:18 AM, Olaoluwa Osuntokun < >> laolu32@gmail.com> wrote: >> >> Hi y'all, >> >> I found some spare time this last weekend to dust off a little side >> project >> I started last August: extend TinyGo [1] to be able to produce RISC-V EL= F >> binaries capable of being run as a guest on the risc0 platform to genera= te >> zk-STARK proofs of arbitrary programs. Initially, I didn't really have a >> clear end target application, it was mainly a technical challenge to for= ce >> me to learn a bit more about the RISC-V platform, and also the host/gues= t >> architecture of risc0. Fast forward ~9 months later, and an initial kill= er >> use case popped into my mind: a zk-STARK proof that a Taproot output >> public >> key was generated using BIP-32, via a given BIP-86 derivation path. >> >> More formally: >> ```math >> \mathcal{R} =3D \left\lbrace\; >> (\overbrace{K,\, C}^{\textsf{public}} ;\; \underbrace{s,\, >> \mathbf{p}}_{\textsf{witness}}) >> \;\middle|\; >> \begin{aligned} >> K &=3D \textsf{BIP86Taproot}\bigl(\textsf{BIP32Derive}(s,\, >> \mathbf{p})\bigr) \\ >> C &=3D \textsf{SHA256}\bigl(\texttt{"bip32-pq-zkp:path:v1"} \;\|\; >> \mathbf{p}\bigr) >> \end{aligned} >> \;\right\rbrace >> ``` >> >> where $K$ is the Taproot output key, $C$ is the path commitment, $s$ is >> the >> BIP-32 seed, and $\mathbf{p}$ is the derivation path. >> >> >> I was able to get everything working e2e over the weekend, after making >> some tweaks to my initial architectural game plan! >> >> The TL;DR is that: >> >> * Given that the Taproot commitment scheme is post-quantum secure [3], i= n >> the future we can deploy a soft fork to _disable_ the keyspend path, >> and force all Taproot spends to instead flow through the script path >> (not my idea, commonly discussed amongst developers, not sure who >> proposed it first). At that point, Taproot starts to resemble BIP-360. >> >> * That works for script path spends, but then leaves all the BIP-86 >> wallets in a bad position, as they generated outputs that provably >> don't commit to a script path at all. >> >> * A 2023 paper (Protecting Quantum Procrastinators with Signature >> Lifting: A Case Study in Cryptocurrencies [4]) proposed a solution to >> this, >> namely _seed lifting_ (use BIP-32 as the one-way function to the >> Picnic PQ Signature scheme) to provide a post-quantum proof of secret >> information a quantum attacker wouldn't be able to easily obtain. >> >> * The downside of that is that it reveals the secret BIP 32 seed, >> exposing other non migrated UTXOs of a user. >> >> * With this project I've cobbled together a series of projects to be abl= e >> to generate a zk-STARK proof that a Taproot output public key was >> generated via BIP-32 invocation of a BIP-86 derivation path. >> >> * In the future a variant of this scheme can be used to enable wallets >> that generated the private keys via BIP-86, to have a post quantum safe >> exit path in case they don't bother moving their coins in time to the >> yet-to-be-decided post quantum signature scheme. >> >> To achieve this end, I needed to create/fork a series of repos: >> >> * tinygo-zkvm: https://github.com/Roasbeef/tinygo-zkvm >> * A fork of TinyGo that supports the flavor of RISC-V (rv32im) that >> risc0 requires to generate/execute a guest program to later be proved >> by the host. >> >> * risc0: https://github.com/Roasbeef/risc0 >> * Mostly a bug fix to their c-guest example, along with some >> additional documentation on how to get things running. The repo is >> unmodified other than that. Recent updates to the repo made the >> entire process much easier (Go guest+host), more on that later. >> >> * go-zkvm: https://github.com/Roasbeef/go-zkvm >> * Go utilities to take a RISC-V ELf binary produced by tinygo-zkvm, and >> package it in the expected R0BF format, which combines the user >> generated RISC-V ELF (the thing that is executed to generate the >> proof) along with the v1compat ELF kernel, which is risc0's execution >> environment. >> >> * This also includes a Go host package, which loads the guest program, >> executes it, and generates a trace to later be proved. This is >> achieved via a C FFI compat layer between Go and the original Rust >> host/proving/verification code. >> >> * bip-32-pq-zkp: https://github.com/Roasbeef/bip32-pq-zkp >> * The project that packages everything together, this contains the: >> * Guest Go program that defines the secret witness and >> claim/constraints of the proof. >> >> * The C FFI wrapper around the OG Rust host, which is used to load >> the guest program, execute it, generate a trace, then finally >> generate a proof. >> >> Details of the final proof as generated on my Mac Book (Apple Silicon M4 >> Max, 128 GB of RAM): >> * Takes ~55 seconds or so to generate+proof, including execution. This >> uses Metal for GPU acceleration on the platform. >> * Uses ~12 GB of ram. >> * Final proof size is ~1.7 MB. >> * Verification takes ~1.8 seconds, and uses ~32 MB of memory. >> >> On several layers, this demo is far from optimized (more on that later), >> this is meant to serve as a PoC to demonstrate that with the latest >> software+hardware, a proof of this complexity is well within reach. >> >> For those curious re the e2e details I've generated this tutorial that >> explains the entire system top to bottom: >> https://github.com/Roasbeef/go-zkvm/blob/main/docs/tutorial.md. >> >> If you got to this point in this mail, and don't care about the lower >> level >> details, thanks for reading up until now, and feel free to return back t= o >> the _The Net of a Million Lies_, or as better known in our Universe: >> Monitoring the Situation and/or slopfotainment! =F0=9F=AB=A1 >> >> ## Motivation + Background >> >> As commonly known, in the case of an adversary that possesses a quantum >> computer capable of breaking classical asymmetric cryptography, any coin= s >> stored in UTXOs with a known public key are vulnerable. This is the case >> for any P2PK outputs from waaaay back, and also any other outputs that >> have >> revealed their public key. Pubkey reveal might happen due to address >> re-use >> (spending from the same script twice), or Taproot outputs, which publish >> the public key plainly in the pkScript. >> >> As detailed in [3], for Taproot outputs, a widely circulated plan is >> roughly to: disable the _keyspend_ path (requires a simple signature), >> enforcing a new rule that all Taproot spends must then flow through the >> script path. Spending via the script path requires an opening of the >> Taproot commitment (C =3D I + H(I || H(M))), which was shown to be bindi= ng >> even >> under classic assumptions, as H(M) (tapscript merkle root) is still a >> collision-resistant function. >> >> That means any UTXO that _does_ commit to a script path has a future >> escape >> hatch _if_ such a softfork would need to be deployed in the future. >> However, what about all the other wallets that use BIP 86, and don't >> commit >> to a script path at all? Under a strict version of this existing >> proposal, those wallets would basically be locked forever. >> >> The goal of this work is to demonstrate a practical solution (discussed >> against devs, but never implemented AFAICT): generate a zk proof that an >> output was generated using BIP-86. For the zk-Proof, we select zk-STARKs= , >> as they're plausibly post quantum since they rely only on symmetric >> cryptography: layers of merkle trees over an execution trace, along with >> some novel sampling/error-correction algorithms. >> >> At this point, you may be asking: "if the quantum adversary can derive t= he >> private key to a random taproot public key, then how exactly does this >> help?". The answer lies in the structure of BIP-32! BIP-32 takes an >> initial >> 128-512-bit seed (with BIP-39, either 12 or 24 words), then runs it >> through >> HMAC-SHA512 keyed by "Bitcoin seed" to produce the master extended priva= te >> key. An adversary who wants to forge this proof needs to find a >> _colliding_ >> seed: a different seed s' such that HMAC-SHA512("Bitcoin seed", s') >> produces >> the same master key. The BHT algorithm (Brassard-Hoyer-Tapp [6]) is the >> best known quantum collision finder, and it runs in time proportional to >> the >> cube root of the output space: 2^(n/3). For HMAC-SHA512's 512-bit output= , >> that's ~2^171 quantum operations, well above even NIST's highest >> post-quantum security category. Therefore, if you generated a wallet usi= ng >> BIP-32, you possess _another_ secret that a quantum adversary can't >> efficiently reconstruct! >> >> This demo focuses on the Taproot case, but the rough approach also appli= es >> to any other output generated via BIP-32. BIP 32 was originally publishe= d >> in >> 2012, over 14 years ago. So safe to say that _most_ wallets were generat= ed >> under this scheme. However, Bitcoin Core only officially adopted BIP-32 = in >> 2016/2018, moving away from their existing key pool structure. I can't s= ay >> how much BTC is held today in outputs generated with Bitcoin Core's >> original >> key pool, but if you have coins generated via that mechanism, you may wa= nt >> to consider migrating them to a BIP-32 wallet. >> >> ## TinyGo + RISC-V + risc0 >> >> Now for some of the lower level details. risc0 is a STARK based proving >> system that takes a RISC-V ELF binary generated by a guest program (any >> program generating using their flavor of rv32im can be proved), executes >> that in a host environment, generates a trace, then produces a STARK pro= of >> from that. >> >> Today you can take some subset of Rust, compile it to an ELF using their >> toolchain, then execute it, generate a trace, to finally prove+verify it >> using their system. >> >> This demo took a bit of a round about journey to achieve this, as after >> all, the journey is most of the fun, ain't it! >> >> For the past 10 years or so, my Bitcoin stack of choice (lnd/btcsuite) >> uses >> a series of Go libraries, so I wanted to be able to re-use them, first f= or >> this demo, then also in the future for other projects. >> >> TinyGo is a special Go compiler based on LLVM, that targets mostly >> embedded >> environments. You can use it to generate go programs that can run on >> micro controllers, or on web assembly (producing a smaller binary than i= f >> you used the normal stdlib path). >> >> TinyGo supports RISC-V, but _not_ the 32-bit variant of RISC-V that risc= 0 >> relies on. So the first step here was to create a new target definition >> for >> TinyGo: riscv32-unknown-none, which uses base integer + multiply/divide >> instructions with no compressed instructions, which uses 4 KB stacks for >> each task. From there, I created a new linker script >> (`targets/riscv32im-risc0-zkvm-elf.ld`) which created a memory layer >> identical to what risc0 expects. The final component was a new runtime >> (`src/runtime/runtime_zkvm.go`), which implemented a few platform specif= ic >> syscalls for risc0 (putchar(), exit(), ticks(), and growHeap()). >> >> When I tried to get this working last year, I had to also implement a >> number >> of kernel syscalls (called ecalls in the platform [7]) to handle: >> read+write >> to stdin/stdout, halting, and the journaling mechanism (the transcript o= f >> execution committed to), which basically implement the kernel that the >> guest >> executes in. Fast forward to 2026, and after pulling the latest version = of >> the repo, I realized that they now make a libzkvm_platform.a, which >> packages >> up the kernel nicely to be linked against. So I threw out my custom kern= el >> code, and slotted that in instead. >> >> The final component is a C FFI layer that enables me to use _both_ a Go >> guest (the program to be proved) and a Go host (the thing that executes >> the >> program and generates the final proof). >> >> ## BIP-32+Taproot zk-STARK Proof >> >> With basic proofs working (like the classic: I know the factorization of= a >> number `n`), I was unblocked to generate the actual proof. The claim/pro= of >> is represented with the following JSON artifact: >> ``` >> { >> "schema_version": 1, >> "image_id": >> "8a6a2c27dd54d8fa0f99a332b57cb105f88472d977c84bfac077cbe70907a690", >> "claim_version": 1, >> "claim_flags": 1, >> "require_bip86": true, >> "taproot_output_key": >> "00324bf6fa47a8d70cb5519957dd54a02b385c0ead8e4f92f9f07f992b288ee6", >> "path_commitment": >> "4c7de33d397de2c231e7c2a7f53e5b581ee3c20073ea79ee4afaab56de11f74b", >> "journal_hex": >> "010000000100000000324bf6fa47a8d70cb5519957dd54a02b385c0ead8e4f92f9f07f9= 92b288ee64c7de33d397de2c231e7c2a7f53e5b581ee3c20073ea79ee4afaab56de11f74b", >> "journal_size_bytes": 72, >> "proof_seal_bytes": 1797880, >> "receipt_encoding": "borsh" >> } >> ```` >> >> The `image_id` is basically a hash of the ELF, so you know what the prov= er >> executed. There are then a few flags that control the claim version and >> whether BIP-86 derivation is a part of the proof. BIP-86 was only adopte= d >> post-Taproot, so if you have an existing BIP-44 path, you can instead op= t >> to >> claim that instead. The Taproot key we're generating the proof against i= s >> also part of the _public data_, as it sits plainly on the chain for all = to >> see. We then also include a `path_commitment`, which is a commitment to >> the >> exact BIP 86 path that the prover used. Finally, we also commit to the >> journal hex, which is basically a commitment to the public claim. >> >> Assuming you've built the project, then you can generate the proof (even >> passing in an arbitrary BIP-32 seed and derivation path with) >> ``` >> make prove GO_GOROOT=3D/path/to/go1.24.4 >> ``` >> >> Then verify it with: >> ``` >> make verify GO_GOROOT=3D/path/to/go1.24.4 >> ``` >> >> The default prove target writes: >> * ./artifacts/bip32-test-vector.receipt >> * ./artifacts/bip32-test-vector.claim.json >> >> The receipt is the STARK proof artifact. claim.json is the stable, >> human-readable description of the public statement being proved. >> >> ## Application to a Future Keyspend Disabling Soft fork >> >> As mentioned above, assuming the community is forced to deploy a keyspen= d >> disabling soft fork in the future, we can also deploy some variant of >> this proof to enable both BIP-86 wallets, and also any BIP-32 wallet, to >> sweep their funds into a new PQ output. >> >> In 2026, we've shown that this is achievable using 2 year old consumer >> hardware. I don't doubt that the upcoming advancements (eg: photonics, n= ew >> flavor of high bandwidth memory, etc) in hardware (driven by the fierce = AI >> race) will make such a proof even more feasible. >> >> One thing to note is that this proof has a few layers of indirection, >> mainly the RISC-V layer that adds overhead which increase the total amou= nt >> of steps, and therefore the size of the proof. A production grade >> deployment would likely instead hand roll a custom STARK proof for this >> exact statement, to achieve a faster and smaller proof). >> >> # Future Work >> >> In terms of future work, there're a number of interesting following up >> projects that can be pursued from here. >> >> One basic one is that the current proof doesn't actually commit to a >> spending txid and/or sighash. That can be trivially incorporated into th= e >> proof. Going a step further, the execution of the guest program can even >> _generate_ a valid schnorr signature to permit spending. >> >> Looking to the memory+computational requirements necessary to generate t= he >> proof, I've left two low hanging fruits: >> >> 1. First, we can speed up the Elliptic Curve operations the proof requir= es >> (scalar base mult, then addition, or more performantly Double Scalar >> Multiplication via the Strauss-Shamir trick). For this we can use the >> syscalls/precompile in the risc0 env for big integer arithmetic: >> sys_bigint and sys_bigint2. With this, the guest calls into the kernel >> to use an optimized/accelerated circuit for the modular arithmetic, >> reducing cycles, steps, and thus proof size. >> >> 2. Second right now, the entire claim is a single proof. Instead, we can >> first break that up using their recursive proof/composition syscalls: >> sys_verify_integrity+sys_verify_integrity2. We can then assembled a >> series of these proofs into a _single_ statement, which can save block >> space by aggregating N proofs into a single proof. >> >> -- Laolu >> >> [1]: https://tinygo.org/ >> >> [2]: https://risczero.com/ >> >> [3]: https://eprint.iacr.org/2025/1307 >> >> [4]: https://eprint.iacr.org/2023/362 >> >> [5]: https://microsoft.github.io/Picnic/ >> >> [6]: https://en.wikipedia.org/wiki/BHT_algorithm >> >> [7]: >> https://github.com/Roasbeef/go-zkvm/blob/main/docs/ecall-reference.md >> >> -- >> You received this message because you are subscribed to the Google Group= s >> "Bitcoin Development Mailing List" group. >> To unsubscribe from this group and stop receiving emails from it, send a= n >> email to bitcoindev+unsubscribe@googlegroups.com. >> To view this discussion visit >> https://groups.google.com/d/msgid/bitcoindev/CAO3Pvs_PciUi%2BzBrCps3acO1= 4sgeHVUANx9w6TVwUf_AYcd_qQ%40mail.gmail.com >> . >> >> >> -- >> You received this message because you are subscribed to the Google Group= s >> "Bitcoin Development Mailing List" group. >> To unsubscribe from this group and stop receiving emails from it, send a= n >> email to bitcoindev+unsubscribe@googlegroups.com. >> To view this discussion visit >> https://groups.google.com/d/msgid/bitcoindev/ciibnh-b0x-rLwA8pY5NURBfPvG= 58gLcS7yPLIIkFV5IzA1k-PTsPZqYU8uUyQRxLCnEFhGcrRCTM39N2AYEy0Db2H_UwIse3Hg9XE= XNEYg%3D%40proton.me >> . >> >> >> --=20 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 e= mail to bitcoindev+unsubscribe@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/bitcoindev/= CAO3Pvs9tps%3DbsMQyA%2BHvhK-u%2BXqRwWtjTq8WXZi%2BcveAVwPi9A%40mail.gmail.co= m. --000000000000b22f29064f0e10a1 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Hi Condution,=C2=A0

So I implemented both variants = of your idea. My intuition was right in that it
doesn't do much to r= educe the size of the=C2=A0final succinct=C2=A0size, but the final
xpriv= variant resulted in a significant reduction in both proving time, and
a= lso memory usage. I also re-ran the original succint proof for the original=
Taproot claim and got a better value for the final proof time (def need= a
better benchmark env+set up!).

Here's a breakdown of the r= esource requirements for the various proofs:
=C2=A0 * Full Taproot
= =C2=A0 =C2=A0 image ID:
=C2=A0 =C2=A0 =C2=A0 8a6a2c27dd54d8fa0f99a332b57= cb105f88472d977c84bfac077cbe70907a690
=C2=A0 =C2=A0 composite:
=C2=A0= =C2=A0 =C2=A0 seal 1797880
=C2=A0 =C2=A0 =C2=A0 prove 49.32s
=C2=A0 = =C2=A0 =C2=A0 verify 0.10s
=C2=A0 =C2=A0 =C2=A0 peak RSS 11907399680
= =C2=A0 =C2=A0 succinct:
=C2=A0 =C2=A0 =C2=A0 seal 222668
=C2=A0 =C2= =A0 =C2=A0 prove 64.30s
=C2=A0 =C2=A0 =C2=A0 verify 0.03s
=C2=A0 =C2= =A0 =C2=A0 peak RSS 11927207936

=C2=A0 * Hardened xpub
=C2=A0 =C2= =A0 image ID:
=C2=A0 =C2=A0 ad4ebc0ef6ce51e0f581cc8d14742a5b97738e9decd3= fe2b0f1746de5bad9617
=C2=A0 =C2=A0 composite:
=C2=A0 =C2=A0 =C2=A0 se= al 513680
=C2=A0 =C2=A0 =C2=A0 prove 14.63s
=C2=A0 =C2=A0 =C2=A0 veri= fy 0.04s
=C2=A0 =C2=A0 =C2=A0 peak RSS 11783503872
=C2=A0 =C2=A0 succ= inct:
=C2=A0 =C2=A0 =C2=A0 seal 222668
=C2=A0 =C2=A0 =C2=A0 prove 17.= 29s
=C2=A0 =C2=A0 =C2=A0 verify 0.02s
=C2=A0 =C2=A0 =C2=A0 peak RSS 1= 1782307840

=C2=A0 * Hardened xpriv
=C2=A0 =C2=A0 image ID:
=C2= =A0 =C2=A0 =C2=A0 8401a36e4f54cb2beaf9ac7677603806cf9d775e90ef5a70168045a3c= 0df0849
=C2=A0 =C2=A0 composite:
=C2=A0 =C2=A0 =C2=A0 seal 234568
= =C2=A0 =C2=A0 =C2=A0 prove 1.98s
=C2=A0 =C2=A0 =C2=A0 verify 0.02s
= =C2=A0 =C2=A0 =C2=A0 peak RSS 3144171520
=C2=A0 =C2=A0 succinct:
=C2= =A0 =C2=A0 =C2=A0 seal 222668
=C2=A0 =C2=A0 =C2=A0 prove 2.84s
=C2=A0= =C2=A0 =C2=A0 verify 0.02s
=C2=A0 =C2=A0 =C2=A0 peak RSS 3145990144
=
So we can see that the succinct proof sizes are all about the same. How= ever the
xpriv variant can be proved directly in just 2 seconds on my ma= chine! It also
requires just 3 GB of memory for the proof as well.
I've created some additional supporting documentation to detail exact= ly what
the new proofs do and their results:

=C2=A0 * https://github.com/Roasbeef/bip32-pq-zkp/blob/1c89fdb398180a2b3eff7761= b7f4b233d455c6c9/README.md#reduced-proof-variants

=C2=A0 * https://github.com/= Roasbeef/bip32-pq-zkp/blob/438c548ca9b49d83ef4019974a5171f5e06fa840/docs/cl= aim.md#reduced-variant-claims


Once again, thanks for the gre= at ideas! I wonder if we can improve on this
round of proof golf further= before reaching down a lower level with some sort
of AIR compiler =F0= =9F=A4=94.

-- Laolu

On Th= u, Apr 9, 2026 at 1:53=E2=80=AFPM Olaoluwa Osuntokun <laolu32@gmail.com> wrote:
Hi Conduition,
> You need only prove this much more general statement (2): "I= know a BIP32
> xpriv which derives this xpub via one or more hardene= d steps".

> I'm amending my prior suggestion slightly: T= he circuit (guest program)
> could take in an xpriv (e.g. at m/86'= ;/0') and output a child xpriv
> (e.g. at m/86'/0'/0'= ) to the journal (instead of outputting a child
> xpub).

That= 's an excellent insight!

As mentioned in my recent reply, with = risc0's "succinct" receipt type, I was
able to get the pro= of size down to 220 KB, at the cost of 3.5x longer total
proving time.
Your proposal definitely reduces the complexity of the core statement= to be
proved, which would speed up the proving time for the normal
d= efault/composite receipt type.

I'll try to hack this up, and th= en run a head to head comparison to see this
simpler statement actually = results in a smaller proof then the final
succinct receipt of either of = the proof variants. Based on my current
intuition w.r.t the lower level = details, I think the final succinct proof
size would be on the same orde= r of magnitude re size.

However, this can still be a win as then thi= s would provide potential future
users with a less resource intensive pr= oof, which can then be
aggregated/rolled up into a final succinct proof = in a batched manner.

This line of optimization is also more interest= ing if one were to look at
hand rolling a custom AIR to avoid the overhe= ad that the RISC-V emulation
adds to the rirsc0 proof chain, given that = it entirely skips doing any EC
operations at all for the final statement= .

----

Re the commit/reveal approach, to be honest I'm no= t fully caught up on that
proposal. That original thread got pretty long= , so I dropped of after a
point =F0=9F=98=85. I'll revisit that spec= ific branch of the thread so I can digest it
and develop a proper opinio= n, then get back to you re comparisons!

-- Laolu

=
On Wed= , Apr 8, 2026 at 1:23=E2=80=AFPM conduition <conduition@proton.me> wrote:
Oh, I've been a fool, a foolish fool= .

We don't ev= en need to do point multiplication in the circuit at all.

I'm amending my prior sugges= tion slightly: The circuit (guest program) could take in an xpriv (e.g. at = m/86'/0'=E2=80=8B) and output a child xpriv (e.= g. at=C2=A0m/86'/0'/0'=E2=80=8B) to the journal (i= nstead of outputting a child xpub).=C2=A0

This is safe because remember, EC spending = has been disabled in this context, and to a quantum attacker, an xpub is co= mputationally equivalent to its xpriv. So why bother hiding it? The child x= priv doesn't give an observer anything they can't already do with t= he equivalent xpub.=C2=A0

The guest program then is basically the BIP32 CKDpriv algorithm, r= estricted to a single hardened derivation step. The verifier gets the child= xpriv, but can't use it to forge new proofs. Honest verifiers use the = xpriv to derive the child address(es) as suggested in my last message, to a= uthenticate spending.

Designing the guest program like this will massively reduce your circu= it complexity, because EC point multiplication is wayyyyy harder for= the RISC0 compiler to arithmetize than a simple hash function. In my prior work with RISC0, I made a guest progr= am which ran a SHA256 hash and an EC point multiplication. I found that pru= ning EC point arithmetic from my guest program improved prover runtime by a= factor of over 100x.

If I am not fever-dreaming and this is indeed possible, then the new c= ircuit's complexity will be dominated not by point multiplication, but = by the HMAC-SHA512 call. Our new task is then to figure out how much we can= internally optimize the HMAC-SHA512 call for STARK proving. Here's a f= ew ideas.
<= br>
If you = bust open HMAC-SHA512, it looks like this:

HMAC_SHA512 =3D SHA512((K=E2=8A=950x5= c) || SHA512((K=E2=8A=950x36) || msg))=E2=80=8B= =C2=A0

=
...where i= n the context of BIP32 hardened CKD, the HMAC key=C2=A0K=E2=80= =8B is the chaincode (padded with zeros to 128 bytes) and msg =3D (0x= 00 || sk || i)=C2=A0is the parent secret key and child index.=C2=A0<= /div>

<= div style=3D"font-family:Arial,sans-serif;font-size:14px">Since len(K= ) =3D 128=E2=80=8B is the SHA512=E2=80=8B block size, we need a tota= l of 4 SHA512 compression calls:=C2=A0
    =
  1. to compress (K=E2= =8A=950x36)=E2=80=8B
  2. to compress the msg=E2=80=8B (and SHA512 paddi= ng/length)
  3. t= o compress=C2=A0(K=E2=8A=950x5c),= and=C2=A0
  4. a= final compression call to tie it all together.=C2=A0

The output of that last compres= sion call is partitioned into the child chaincode, and a key delta which is= added to the parent secret key (modulo the curve order), producing the child EC se= cret key. This last step is arithmetically simple; the SHA512 calls are whe= re most of the arithmetic complexity lies.

The question then becomes, which of th= ese compression calls can be done outside the circuit, and which are truly = essential for security?=C2=A0

Note how the parent secret key is the most important=C2=A0piec= e for soundness. The circuit needs to prove the parent secret key existed i= n the hash function preimage, and is correctly related to the child secret = key via modular addition. So compression call (2) seems unavoidable. The ot= hers are less rigid.

I'd argue that if we really dig into the hard relation we're tr= ying to prove here, we can reduce it to this statement:

Give= n a child xpriv with secret key k=E2=80=8B, chaincode c=E2=80=8B and index i=E2=80=8B,=C2=A0I know a preimage= x=E2=80=8B and secret key = sk=E2=80=8B=C2=A0such that:

I <- SHA512(<something> || SH= A512(<something> || 0x00 || sk || i)=E2=80=8B)
c =3D=3D I[:32]=E2=80=8B
k =3D=3D int(I[32:]) + sk % n=E2=80=8B

Seeing as the <something&g= t;=E2=80=8B slots are arbitrary, and we know in BIP32 they are alway= s exactly one-block long,=C2=A0it seems easy to throw out the compression c= alls (1) and (3). The host can precompute the relevant SHA512 midstates out= side the circuit, and pass the midstates into the guest program as secret i= nputs.=C2=A0The tradeoff is that this=C2=A0permits malicious provers the flexibility = of choosing their starting midstates (though hash input length can be fixed= at 192 bytes). I'm not entirely sure if this meaningfully weakens the = verifier's soundness. Ethan Heilman might have opinions on this, he kno= ws a lot more about attacking hash functions than I do. Intuitively, I doub= t sampling random SHA512 midstates is that much better than sampling a rand= om HMAC key (chaincode)=C2=A0K=E2=80=8B and computing the resu= lting midstates.

This reduces our circuit to, i think,= the minimum acceptable security floor for provers: two SHA512 compression = calls, which commit to a parent secret key.

<= /span>

=
regards,
conduition
On Wednesday, April 8th, 2026 at 12:09 PM, 'conduition' via= Bitcoin Development Mailing List <bitcoindev@googlegroups.com> wrote:
Hi=C2=A0Laolu,

Great work getting this wo= rking in the real world. I've heard many people on delving and the mail= ing list conjecture based on this idea, but you're the first person i&#= 39;ve seen who's willing to put their money where their mouth is, and a= ctually build a prototype. Bravo!

It seems to me t= he circuit (guest program) could be simplified. Notice how=C2=A0the guest code computes the entire HD wa= llet key path, including hardened=C2=A0and=C2=A0<= /span>non-hardened derivation steps, and also computes the taproot outp= ut key with key-tweaking. I'd argue these steps are extraneous to the c= ore hard relation you want the STARK to prove, and could be safely removed = to reduce proof size and improve performance.

In r= eality, you needn't go so far as to prove (1)=C2=A0"I know a BI= P39 seed which derives this taproot output key". You need only pro= ve this much more general statement (2):=C2=A0"I know a BIP32 xpriv= which derives this xpub via one or more hardened steps". The latt= er statement (2) still cannot be forged by a quantum adversary even if they= know your account-level xpub, but it entails far less computation to prove= and verify. The rest of the original statement (1) can be done externally = outside the circuit.

Example. If i have a wallet w= ith a taproot address at=C2=A0m/86'/0'/0'/1/= 2=E2=80=8B, I could prove I know the xpriv at=C2=A0m/86'/0'=E2=80=8B which derives the xpub at=C2=A0m/86'/0'/0'=E2=80=8B. Then I provide the remai= ning key path elements /1/2=E2=80=8B in the witness. Note, i= =C2=A0do not=C2=A0mean we=C2=A0derive=C2=A0the x= priv at=C2=A0m/86'/0'=E2=80=8B inside the= guest program. I mean the prover derives=C2=A0m/86'= /0'=E2=80=8B first (in the host), and=C2=A0then = writes that xpriv into the guest program's inputs.=C2=A0The guest p= rogram derives and outputs the xpub at=C2=A0m/86'/0&= #39;/0'=E2=80=8B.=C2=A0The verifier may check the STARK output (= xpub) is correctly computed, then use the given key-path to manually derive= the taproot address from the xpub themselves, outside the circuit, and val= idate=C2=A0that address=C2=A0against the UTXO i'm s= pending. The verifier thus has confirmed the prover knew an xpriv which (th= rough a hardened derivation step) derives the correct taproot output key.

This change significantly reduces the size of the c= ircuit. From a glance, I see the original guest program performs 6 HMAC-SHA= 512 calls (1 for the master key, 5 for the BIP32 derivation steps), two SHA= 256 compression calls (for the taptweak hash), and two point multiplication= s. With this simplified variant, we are invoking only a single HMAC-SHA512 = call and a single point multiplication. I can't say for sure, but I exp= ect this will improve your proof size and runtime significantly.
=
This change also makes the circuit more generally applicable= to other rescue contexts. For instance, it could be applied to BIP340 xonl= y keys inside a taproot script tree, or in a P2(W)SH address to an ECDSA pu= blic key, or to P2(W)PKH addresses.

Concerned about publishing xpubs? = Remember that we are assuming regular EC spending is locked in this context= , so it is safe-ish to share account xpubs with quantum attackers. At best = the xpub can be used for surveillance but not forgery. If one would = prefer not to share the account-level xpub on-chain for privacy reasons, th= e proof could be extended to also derive the unhardened child xpub at=C2=A0= /1/2=E2=80=8B inside = the guest program (but we still do not need to do the taproot key tweaking = in the guest program).

We should also t= alk scaling efficiency. Given the cost of STARKs, this style of proof shoul= d be able to authorize spends for more than one UTXO. Say you have a wallet= with 10 different UTXOs held by distinct addresses in the same BIP44 accou= nt. One single STARK proof could authorize spending all 10 of them, by simp= ly committing all 10 input signature hashes into the journal, and labeling = the inputs= with=C2=A0the=C2=A0corresponding 10 BIP32 key paths somehow. The verifier= would need to check the proof only once and not 10 times. The 10 UTXO spen= ds could be validated using the common xpub from the STARK proof's jour= nal.

For a slightly related work proving a similar= relation for hashed addresses, using different STARK technology stacks,=C2= =A0see this delving post.
However, all this said, my personal preference for long-term p= rocrastinator rescue is still for commit/reveal strategies which prove esse= ntially the same statement about BIP32 in a two-step procedure. They get th= e job done with much lighter cryptographic machinery and much smaller witne= sses: a few hundred bytes over two transactions, compared to a few million = bytes in one transaction with STARKs.=C2=A0Boris Nagaev and I discussed this on the list a while back. That said,= commit/reveal requires more careful design and seems to demand the use of = external quantum-safe coins to make the commitment in the first place, so p= erhaps the cost would be worth it to some people? IDK. What do you think of= commit/reveal compared to STARKs for this purpose?
=
regards,
conduition

On Wednesday, April 8th, 2026 at 12:18 AM, Olaoluwa Osuntokun <<= a href=3D"mailto:laolu32@gmail.com" target=3D"_blank">laolu32@gmail.com= > wrote:
Hi y'all= ,

I found some spare time this last weekend to dust off a little sid= e project
I started last August: extend TinyGo [1] to be able to produce= RISC-V ELF
binaries capable of being run as a guest on the risc0 platfo= rm to generate
zk-STARK proofs of arbitrary programs. Initially, I didn&= #39;t really have a
clear end target application, it was mainly a techni= cal challenge to force
me to learn a bit more about the RISC-V platform,= and also the host/guest
architecture of risc0. Fast forward ~9 months l= ater, and an initial killer
use case popped into my mind: a zk-STARK pro= of that a Taproot output public
key was generated using BIP-32, via a gi= ven BIP-86 derivation path.

More formally:
```math
\mathcal{R}= =3D \left\lbrace\;
(\overbrace{K,\, C}^{\textsf{public}} ;\; \underbrac= e{s,\, \mathbf{p}}_{\textsf{witness}})
\;\middle|\;
\begin{aligned} K &=3D \textsf{BIP86Taproot}\bigl(\textsf{BIP32Derive}(s,\, \mathbf= {p})\bigr) \\
C &=3D \textsf{SHA256}\bigl(\texttt{"bip32-pq-z= kp:path:v1"} \;\|\; \mathbf{p}\bigr)
\end{aligned}
\;\right\rbra= ce
```

where $K$ is the Taproot output key, $C$ is the path commi= tment, $s$ is the
BIP-32 seed, and $\mathbf{p}$ is the derivation path.<= br>

I was able to get everything working e2e over the weekend, after= making
some tweaks to my initial architectural game plan!

The TL= ;DR is that:

* Given that the Taproot commitment scheme is post-qu= antum secure [3], in
the future we can deploy a soft fork to _disabl= e_ the keyspend path,
and force all Taproot spends to instead flow t= hrough the script path
(not my idea, commonly discussed amongst deve= lopers, not sure who
proposed it first). At that point, Taproot star= ts to resemble BIP-360.

* That works for script path spends, but t= hen leaves all the BIP-86
wallets in a bad position, as they generat= ed outputs that provably
don't commit to a script path at all.
* A 2023 paper (Protecting Quantum Procrastinators with Signature Lifting: A Case Study in Cryptocurrencies [4]) proposed a solution to= this,
namely _seed lifting_ (use BIP-32 as the one-way function to = the
Picnic PQ Signature scheme) to provide a post-quantum proof of s= ecret
information a quantum attacker wouldn't be able to easily = obtain.

* The downside of that is that it reveals the secret BIP 3= 2 seed,
exposing other non migrated UTXOs of a user.

* With= this project I've cobbled together a series of projects to be able
= to generate a zk-STARK proof that a Taproot output public key was
= generated via BIP-32 invocation of a BIP-86 derivation path.

* I= n the future a variant of this scheme can be used to enable wallets
= that generated the private keys via BIP-86, to have a post quantum safe
= exit path in case they don't bother moving their coins in time to t= he
yet-to-be-decided post quantum signature scheme.

To achiev= e this end, I needed to create/fork a series of repos:

* tinygo-zk= vm: https://github.com/Roasbeef/tinygo-zkvm=
* A fork of TinyGo that supports the flavor of RISC-V (rv32im) = that
risc0 requires to generate/execute a guest program to later b= e proved
by the host.

* risc0: = https://github.com/Roasbeef/risc0
* Mostly a bug fix to their c-= guest example, along with some
additional documentation on how to = get things running. The repo is
unmodified other than that. Recent= updates to the repo made the
entire process much easier (Go guest= +host), more on that later.

* go-zkvm: https://github.com/Roasbeef/go-zkvm
* Go utilities to take a RI= SC-V ELf binary produced by tinygo-zkvm, and
package it in the exp= ected R0BF format, which combines the user
generated RISC-V ELF (t= he thing that is executed to generate the
proof) along with the v1= compat ELF kernel, which is risc0's execution
environment.
=
* This also includes a Go host package, which loads the guest progr= am,
executes it, and generates a trace to later be proved. This is=
achieved via a C FFI compat layer between Go and the original Rus= t
host/proving/verification code.

* bip-32-pq-zkp: https://github.com/Roasbeef/bip32-pq-zkp
= * The project that packages everything together, this contains the:
= * Guest Go program that defines the secret witness and
cla= im/constraints of the proof.

* The C FFI wrapper around the OG= Rust host, which is used to load
the guest program, execute it,= generate a trace, then finally
generate a proof.

Details= of the final proof as generated on my Mac Book (Apple Silicon M4
Max, 1= 28 GB of RAM):
* Takes ~55 seconds or so to generate+proof, including = execution. This
uses Metal for GPU acceleration on the platform.
= * Uses ~12 GB of ram.
* Final proof size is ~1.7 MB.
* Verifica= tion takes ~1.8 seconds, and uses ~32 MB of memory.

On several layer= s, this demo is far from optimized (more on that later),
this is meant t= o serve as a PoC to demonstrate that with the latest
software+hardware, = a proof of this complexity is well within reach.

For those curious r= e the e2e details I've generated this tutorial that
explains the ent= ire system top to bottom:
https://github.com/Roasbeef/go-zkvm/blob/main/docs/tutorial.md= .

If you got to this point in this mail, and don't care about th= e lower level
details, thanks for reading up until now, and feel free to= return back to
the _The Net of a Million Lies_, or as better known in o= ur Universe:
Monitoring the Situation and/or slopfotainment! =F0=9F=AB= =A1

## Motivation + Background

As commonly known, in the case= of an adversary that possesses a quantum
computer capable of breaking c= lassical asymmetric cryptography, any coins
stored in UTXOs with a known= public key are vulnerable. This is the case
for any P2PK outputs from w= aaaay back, and also any other outputs that have
revealed their public k= ey. Pubkey reveal might happen due to address re-use
(spending from the = same script twice), or Taproot outputs, which publish
the public key pla= inly in the pkScript.

As detailed in [3], for Taproot outputs, a wid= ely circulated plan is
roughly to: disable the _keyspend_ path (requires= a simple signature),
enforcing a new rule that all Taproot spends must = then flow through the
script path. Spending via the script path requires= an opening of the
Taproot commitment (C =3D I + H(I || H(M))), which wa= s shown to be binding even
under classic assumptions, as H(M) (tapscript= merkle root) is still a
collision-resistant function.

That means= any UTXO that _does_ commit to a script path has a future escape
hatch = _if_ such a softfork would need to be deployed in the future.
However, w= hat about all the other wallets that use BIP 86, and don't commit
to= a script path at all? Under a strict version of this existing
proposal,= those wallets would basically be locked forever.

The goal of this w= ork is to demonstrate a practical solution (discussed
against devs, but = never implemented AFAICT): generate a zk proof that an
output was genera= ted using BIP-86. For the zk-Proof, we select zk-STARKs,
as they're = plausibly post quantum since they rely only on symmetric
cryptography: l= ayers of merkle trees over an execution trace, along with
some novel sam= pling/error-correction algorithms.

At this point, you may be asking:= "if the quantum adversary can derive the
private key to a random t= aproot public key, then how exactly does this
help?". The answer li= es in the structure of BIP-32! BIP-32 takes an initial
128-512-bit seed = (with BIP-39, either 12 or 24 words), then runs it through
HMAC-SHA512 k= eyed by "Bitcoin seed" to produce the master extended private
= key. An adversary who wants to forge this proof needs to find a _colliding_=
seed: a different seed s' such that HMAC-SHA512("Bitcoin seed&= quot;, s') produces
the same master key. The BHT algorithm (Brassard= -Hoyer-Tapp [6]) is the
best known quantum collision finder, and it runs= in time proportional to the
cube root of the output space: 2^(n/3). For= HMAC-SHA512's 512-bit output,
that's ~2^171 quantum operations,= well above even NIST's highest
post-quantum security category. Ther= efore, if you generated a wallet using
BIP-32, you possess _another_ sec= ret that a quantum adversary can't
efficiently reconstruct!

T= his demo focuses on the Taproot case, but the rough approach also appliesto any other output generated via BIP-32. BIP 32 was originally published= in
2012, over 14 years ago. So safe to say that _most_ wallets were gen= erated
under this scheme. However, Bitcoin Core only officially adopted = BIP-32 in
2016/2018, moving away from their existing key pool structure.= I can't say
how much BTC is held today in outputs generated with Bi= tcoin Core's original
key pool, but if you have coins generated via = that mechanism, you may want
to consider migrating them to a BIP-32 wall= et.

## TinyGo + RISC-V + risc0

Now for some of the lower leve= l details. risc0 is a STARK based proving
system that takes a RISC-V ELF= binary generated by a guest program (any
program generating using their= flavor of rv32im can be proved), executes
that in a host environment, g= enerates a trace, then produces a STARK proof
from that.

Today yo= u can take some subset of Rust, compile it to an ELF using their
toolcha= in, then execute it, generate a trace, to finally prove+verify it
using = their system.

This demo took a bit of a round about journey to achie= ve this, as after
all, the journey is most of the fun, ain't it!
=
For the past 10 years or so, my Bitcoin stack of choice (lnd/btcsuite) = uses
a series of Go libraries, so I wanted to be able to re-use them, fi= rst for
this demo, then also in the future for other projects.

Ti= nyGo is a special Go compiler based on LLVM, that targets mostly embeddedenvironments. You can use it to generate go programs that can run on
m= icro controllers, or on web assembly (producing a smaller binary than ifyou used the normal stdlib path).

TinyGo supports RISC-V, but _not_= the 32-bit variant of RISC-V that risc0
relies on. So the first step he= re was to create a new target definition for
TinyGo: riscv32-unknown-non= e, which uses base integer + multiply/divide
instructions with no compre= ssed instructions, which uses 4 KB stacks for
each task. From there, I c= reated a new linker script
(`targets/riscv32im-risc0-zkvm-elf.ld`) which= created a memory layer
identical to what risc0 expects. The final compo= nent was a new runtime
(`src/runtime/runtime_zkvm.go`), which implemente= d a few platform specific
syscalls for risc0 (putchar(), exit(), ticks()= , and growHeap()).

When I tried to get this working last year, I had= to also implement a number
of kernel syscalls (called ecalls in the pla= tform [7]) to handle: read+write
to stdin/stdout, halting, and the journ= aling mechanism (the transcript of
execution committed to), which basica= lly implement the kernel that the guest
executes in. Fast forward to 202= 6, and after pulling the latest version of
the repo, I realized that the= y now make a libzkvm_platform.a, which packages
up the kernel nicely to = be linked against. So I threw out my custom kernel
code, and slotted tha= t in instead.

The final component is a C FFI layer that enables me t= o use _both_ a Go
guest (the program to be proved) and a Go host (the th= ing that executes the
program and generates the final proof).

## = BIP-32+Taproot zk-STARK Proof

With basic proofs working (like the cl= assic: I know the factorization of a
number `n`), I was unblocked to gen= erate the actual proof. The claim/proof
is represented with the followin= g JSON artifact:
```
{
"schema_version": 1,
"= ;image_id": "8a6a2c27dd54d8fa0f99a332b57cb105f88472d977c84bfac077= cbe70907a690",
"claim_version": 1,
"claim_fla= gs": 1,
"require_bip86": true,
"taproot_outpu= t_key": "00324bf6fa47a8d70cb5519957dd54a02b385c0ead8e4f92f9f07f99= 2b288ee6",
"path_commitment": "4c7de33d397de2c231e= 7c2a7f53e5b581ee3c20073ea79ee4afaab56de11f74b",
"journal_hex= ": "010000000100000000324bf6fa47a8d70cb5519957dd54a02b385c0ead8e4= f92f9f07f992b288ee64c7de33d397de2c231e7c2a7f53e5b581ee3c20073ea79ee4afaab56= de11f74b",
"journal_size_bytes": 72,
"proof_s= eal_bytes": 1797880,
"receipt_encoding": "borsh&qu= ot;
}
````

The `image_id` is basically a hash of the ELF, so y= ou know what the prover
executed. There are then a few flags that contro= l the claim version and
whether BIP-86 derivation is a part of the proof= . BIP-86 was only adopted
post-Taproot, so if you have an existing BIP-4= 4 path, you can instead opt to
claim that instead. The Taproot key we= 9;re generating the proof against is
also part of the _public data_, as = it sits plainly on the chain for all to
see. We then also include a `pat= h_commitment`, which is a commitment to the
exact BIP 86 path that the p= rover used. Finally, we also commit to the
journal hex, which is basical= ly a commitment to the public claim.

Assuming you've built the p= roject, then you can generate the proof (even
passing in an arbitrary BI= P-32 seed and derivation path with)
```
make prove GO_GOROOT=3D/path/= to/go1.24.4
```

Then verify it with:
```
make verify GO_GOR= OOT=3D/path/to/go1.24.4
```

The default prove target writes:
= * ./artifacts/bip32-test-vector.receipt
* ./artifacts/bip32-test-vect= or.claim.json

The receipt is the STARK proof artifact. claim.json is= the stable,
human-readable description of the public statement being pr= oved.

## Application to a Future Keyspend Disabling Soft fork
As mentioned above, assuming the community is forced to deploy a keyspend<= br>disabling soft fork in the future, we can also deploy some variant ofthis proof to enable both BIP-86 wallets, and also any BIP-32 wallet, tosweep their funds into a new PQ output.

In 2026, we've shown t= hat this is achievable using 2 year old consumer
hardware. I don't d= oubt that the upcoming advancements (eg: photonics, new
flavor of high b= andwidth memory, etc) in hardware (driven by the fierce AI
race) will ma= ke such a proof even more feasible.

One thing to note is that this p= roof has a few layers of indirection,
mainly the RISC-V layer that adds = overhead which increase the total amount
of steps, and therefore the siz= e of the proof. A production grade
deployment would likely instead hand = roll a custom STARK proof for this
exact statement, to achieve a faster = and smaller proof).

# Future Work

In terms of future work, th= ere're a number of interesting following up
projects that can be pur= sued from here.

One basic one is that the current proof doesn't = actually commit to a
spending txid and/or sighash. That can be trivially= incorporated into the
proof. Going a step further, the execution of the= guest program can even
_generate_ a valid schnorr signature to permit s= pending.

Looking to the memory+computational requirements necessary = to generate the
proof, I've left two low hanging fruits:

1. = First, we can speed up the Elliptic Curve operations the proof requires
= (scalar base mult, then addition, or more performantly Double Scalar Multiplication via the Strauss-Shamir trick). For this we can use the<= br> syscalls/precompile in the risc0 env for big integer arithmetic:
= sys_bigint and sys_bigint2. With this, the guest calls into the kernel<= br> to use an optimized/accelerated circuit for the modular arithmetic,<= br> reducing cycles, steps, and thus proof size.

2. Second right= now, the entire claim is a single proof. Instead, we can
first brea= k that up using their recursive proof/composition syscalls:
sys_veri= fy_integrity+sys_verify_integrity2. We can then assembled a
series o= f these proofs into a _single_ statement, which can save block
space= by aggregating N proofs into a single proof.

-- Laolu

[1]: <= a href=3D"https://tinygo.org/" rel=3D"noreferrer nofollow noopener" target= =3D"_blank">https://tinygo.org/

[2]: https://riscz= ero.com/

[3]: https://eprint.iacr.org= /2025/1307

[4]: https://eprint.iacr.org= /2023/362

[5]: https://microsoft.git= hub.io/Picnic/

[6]: https://= en.wikipedia.org/wiki/BHT_algorithm

[7]: https://github.com/Roasbeef/go-zkvm/= blob/main/docs/ecall-reference.md

--
You received this message because you are subscribed to the Google Groups &= quot;Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an e= mail to bitcoindev+unsubscribe@googl= egroups.com.
To view this discussion visit https://grou= ps.google.com/d/msgid/bitcoindev/CAO3Pvs_PciUi%2BzBrCps3acO14sgeHVUANx9w6TV= wUf_AYcd_qQ%40mail.gmail.com.

--
You received this message because you are subscribed to the Google Groups &= quot;Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an e= mail to bitcoindev+unsubscribe@googl= egroups.com.
To view this discussion visit https://groups.google.com/d/msgid/b= itcoindev/ciibnh-b0x-rLwA8pY5NURBfPvG58gLcS7yPLIIkFV5IzA1k-PTsPZqYU8uUyQRxL= CnEFhGcrRCTM39N2AYEy0Db2H_UwIse3Hg9XEXNEYg%3D%40proton.me.

--
You received this message because you are subscribed to the Google Groups &= quot;Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an e= mail to bitcoind= ev+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.= com/d/msgid/bitcoindev/CAO3Pvs9tps%3DbsMQyA%2BHvhK-u%2BXqRwWtjTq8WXZi%2Bcve= AVwPi9A%40mail.gmail.com.
--000000000000b22f29064f0e10a1--