Bitcoin full node and query server

Apr 4, 2018

View in context in the libbitcoin Slack #general mirror.

narodnik14:21

to prove something is either 2 or 0, you need ring signatures because they have the property that you know the signature came from a set of keys, but you don't know which key, so a signature is provided proving that the value is either 0 (using public key derived from first equation) or 2 (using public key derived from second equation) but you don't know which key specifically, just that it's either of them.

🤔 1👍 1

James C.19:51

Hi @neillm, from what I understand, each confidential tx will have individual input, output, fee amounts all individually commited as Cin, Cout, Cfee. For all of them to sum up to 0, the blinding factor for a given transaction has to be consistent for all commitments, and provably non-negative amounts via Ring Signatures. So I don't quite get how a given hidden output amount makes it into the next spending transaction as the new hidden input amount, since the two transactions (prev vs spending) will likely have different blinding factors...

(edited)