š
Original date posted:2022-03-05
š Original message:Good morning Russell,
> On Sat, Mar 5, 2022 at 8:41 AM Jeremy Rubin via bitcoin-dev <bitcoin-dev at lists.linuxfoundation.org> wrote:
>
> > It seems like a decent concept for exploration.
> >
> > AJ, I'd be interested to know what you've been able to build with Chia Lisp and what your experience has been... e.g. what does the Lightning Network look like on Chia?
> >
> > One question that I have had is that it seems like to me that neither simplicity nor chia lisp would be particularly suited to a ZK prover...
>
> Not that I necessarily disagree with this statement, but I can say that I have experimented with compiling Simplicity to Boolean circuits.Ā It was a while ago, but I think the result of compiling my SHA256 program was within an order of magnitude of the hand made SHA256 circuit for bulletproofs.
"Within" can mean "larger" or "smaller" in this context, which was it?
>From what I understand, compilers for ZK-provable circuits are still not as effective as humans, so I would assume "larger", but I would be much interested if it is "smaller"!
Regards,
ZmnSCPxj
ZmnSCPxj [ARCHIVE] /
npub1g5ā¦3ms3l
2023-06-07 23:05:14
in reply to nevent1qā¦80v7
Author Public Key
npub1g5zswf6y48f7fy90jf3tlcuwdmjn8znhzaa4vkmtxaeskca8hpss23ms3lPublished at
2023-06-07 23:05:14Event JSON
{
"id": "58e233272c2bae7a0db543d4bed0b53b0a8dcea43715bfef7c86761573e03fcd",
"pubkey": "4505072744a9d3e490af9262bfe38e6ee5338a77177b565b6b37730b63a7b861",
"created_at": 1686179114,
"kind": 1,
"tags": [
[
"e",
"17a237ce59197bc5ffad96769beec5209b19830977cb935d9412190ad411e7e9",
"",
"root"
],
[
"e",
"be23c414d0cf57a1c339fbfbe66d07f9b527a198c552595a3645f905a411fd3d",
"",
"reply"
],
[
"p",
"6b8e77368804013d7126ba4b77c7963bcfeff909135791531097d7a0f03ca85d"
]
],
"content": "š
Original date posted:2022-03-05\nš Original message:Good morning Russell,\n\n\u003e On Sat, Mar 5, 2022 at 8:41 AM Jeremy Rubin via bitcoin-dev \u003cbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\u003e\n\u003e \u003e It seems like a decent concept for exploration.\n\u003e \u003e\n\u003e \u003e AJ, I'd be interested to know what you've been able to build with Chia Lisp and what your experience has been... e.g. what does the Lightning Network look like on Chia?\n\u003e \u003e\n\u003e \u003e One question that I have had is that it seems like to me that neither simplicity nor chia lisp would be particularly suited to a ZK prover...\n\u003e\n\u003e Not that I necessarily disagree with this statement, but I can say that I have experimented with compiling Simplicity to Boolean circuits.Ā It was a while ago, but I think the result of compiling my SHA256 program was within an order of magnitude of the hand made SHA256 circuit for bulletproofs.\n\n\"Within\" can mean \"larger\" or \"smaller\" in this context, which was it?\n\u003eFrom what I understand, compilers for ZK-provable circuits are still not as effective as humans, so I would assume \"larger\", but I would be much interested if it is \"smaller\"!\n\nRegards,\nZmnSCPxj",
"sig": "c385b34ea4b462b4fb580b4a13a00993093de70561f2f420f9fb58f88b79d68442d9b0c36c773b638e45099e7574a7cfe91b92805cb0b52328e62ba15cb26b97"
}