ZmnSCPxj [ARCHIVE] on Nostr: š
Original date posted:2021-08-10 š Original message: Good morning Billy, et ...
š
Original date posted:2021-08-10
š Original message:
Good morning Billy, et al.,
> For sure, CT can be done with computational soundness. The advantage of unhidden amounts (as with current bitcoin) is that you get unconditional soundness.
My understanding is that it should be possible to have unconditional soundness with the use of El-Gamal commitment scheme, am I wrong?
Alternately, one possible softforkable design would be for Bitcoin to maintain a non-CT block (the current scheme) and a separately-committed CT block (i.e. similar to how SegWit has a "separate" "block"/Merkle tree that includes witnesses).
When transferring funds from the legacy non-CT block, on the legacy block you put it into a "burn" transaction that magically causes the same amount to be created (with a trivial/publicly known salt) in the CT block.
Then to move from the CT block back to legacy non-CT you would match one of those "burn" TXOs and spend it, with a proof that the amount you are removing from the CT block is exactly the same value as the "burn" TXO you are now spending.
(for additional privacy, the values of the "burn" TXOs might be made into some fixed single allowed value, so that transfers passing through the CT portion would have fewer identifying features)
The "burn" TXOs would be some trivial anyone-can-spend, such as `<saltpoint> <0> OP_EQUAL OP_NOT` with `<saltpoint>` being what is used in the CT to cover the value, and knowledge of the scalar behind this point would allow the CT output to be spent (assuming something very much like MimbleWimble is used; otherwise it could be the hash of some P2WSH or similar analogue on the CT side).
Basically, this is "CT as a 'sidechainlike' that every fullnode runs".
In the legacy non-CT block, the total amount of funds that are in all CT outputs is known (it would be the sum total of all the "burn" TXOs) and will have a known upper limit, that cannot be higher than the supply limit of the legacy non-CT block, i.e. 21 million BTC.
At the same time, *individual* CT-block TXOs cannot have their values known; what is learnable is only how many BTC are in all CT block TXOs, which should be sufficient privacy if there are a large enough number of users of the CT block.
This allows the CT block to use an unconditional privacy and computational soundness scheme, and if somehow the computational soundness is broken then the first one to break it would be able to steal all the CT coins, but not *all* Bitcoin coins, as there would not be enough "burn" TXOs on the legacy non-CT blockchain.
This may be sufficient for practical privacy.
On the other hand, I think the dust limit still makes sense to keep for now, though.
Regards,
ZmnSCPxj
Published at
2023-06-09 13:03:18Event JSON
{
"id": "6323a6656b5cf82ee7217e9e74ea7b70b6dae0a2d787f1e87046933155a6110d",
"pubkey": "4505072744a9d3e490af9262bfe38e6ee5338a77177b565b6b37730b63a7b861",
"created_at": 1686315798,
"kind": 1,
"tags": [
[
"e",
"b41c7f5be0f6c2276459cf421fc852a8fb9e49b32919a16a29ba72db1840cfc7",
"",
"root"
],
[
"e",
"d749677d2952e606bd130f170987030e3e8ca6c921139cb07977785732e781f3",
"",
"reply"
],
[
"p",
"3030ec2d70259fdd55ba8e063740c139c3daaa618f86e3fae34cebcb73c742ba"
]
],
"content": "š
Original date posted:2021-08-10\nš Original message:\nGood morning Billy, et al.,\n\n\u003e For sure, CT can be done with computational soundness. The advantage of unhidden amounts (as with current bitcoin) is that you get unconditional soundness.\n\nMy understanding is that it should be possible to have unconditional soundness with the use of El-Gamal commitment scheme, am I wrong?\n\nAlternately, one possible softforkable design would be for Bitcoin to maintain a non-CT block (the current scheme) and a separately-committed CT block (i.e. similar to how SegWit has a \"separate\" \"block\"/Merkle tree that includes witnesses).\nWhen transferring funds from the legacy non-CT block, on the legacy block you put it into a \"burn\" transaction that magically causes the same amount to be created (with a trivial/publicly known salt) in the CT block.\nThen to move from the CT block back to legacy non-CT you would match one of those \"burn\" TXOs and spend it, with a proof that the amount you are removing from the CT block is exactly the same value as the \"burn\" TXO you are now spending.\n\n(for additional privacy, the values of the \"burn\" TXOs might be made into some fixed single allowed value, so that transfers passing through the CT portion would have fewer identifying features)\n\nThe \"burn\" TXOs would be some trivial anyone-can-spend, such as `\u003csaltpoint\u003e \u003c0\u003e OP_EQUAL OP_NOT` with `\u003csaltpoint\u003e` being what is used in the CT to cover the value, and knowledge of the scalar behind this point would allow the CT output to be spent (assuming something very much like MimbleWimble is used; otherwise it could be the hash of some P2WSH or similar analogue on the CT side).\n\nBasically, this is \"CT as a 'sidechainlike' that every fullnode runs\".\n\nIn the legacy non-CT block, the total amount of funds that are in all CT outputs is known (it would be the sum total of all the \"burn\" TXOs) and will have a known upper limit, that cannot be higher than the supply limit of the legacy non-CT block, i.e. 21 million BTC.\nAt the same time, *individual* CT-block TXOs cannot have their values known; what is learnable is only how many BTC are in all CT block TXOs, which should be sufficient privacy if there are a large enough number of users of the CT block.\n\nThis allows the CT block to use an unconditional privacy and computational soundness scheme, and if somehow the computational soundness is broken then the first one to break it would be able to steal all the CT coins, but not *all* Bitcoin coins, as there would not be enough \"burn\" TXOs on the legacy non-CT blockchain.\n\nThis may be sufficient for practical privacy.\n\n\nOn the other hand, I think the dust limit still makes sense to keep for now, though.\n\nRegards,\nZmnSCPxj",
"sig": "d3a17a18dafa9f0002749f82fcc208a5cfea714d1e13f7fccbd7a9dec69d51e62a19cb724df20aff83a6f2c8addecbe1f86d91dddce8fce1628c7f25a2ce1405"
}