3 ms·
I pre-compute two trees T1 and T2, which sum to my claimed total. T1 has a fake user with a negative balance who is visible to @nullc. T2 has a fake user with
by patio11 13y ago
I pre-compute two trees T1 and T2, which sum to my claimed total. T1 has a fake user with a negative balance who is visible to @nullc. T2 has a fake user with a negative balance who is visible to @legit_user.
If I show @nullc T2 and @legit_user T1, you will both perceive my books as balancing, unless you collude with each other. I can greatly reduce the odds of you successfully colluding by choosing @legit_user to be someone who, e.g., has not logged in in a year, or who hasn't ever bothered to open this verification page.
- nullc 13y agoThis is why you must present the root via a broadcast channel, and quantize the timing (E.g. just daily). Otherwise it has the same problems as certificate transparency). People should really go read the original discussion. One fun way to address the root commitment is to just commit to it in the coins being proven in the balance.