James A. Donald writes:
-+---
| Is there a way of constructing a digital signature so
| that the signature proves that at least m possessors of
| secret keys corresponding to n public keys signed, for n
| a dozen or less, without revealing how many more than m,
| or which
--
James A. Donald wrote:
OK, suppose one node incorporates a bunch of
transactions in its proof of work, all of them honest
legitimate single spends and another node
incorporates a different bunch of transactions in its
proof of work, all of them equally honest legitimate
single
James A. Donald wrote:
Furthermore, it cannot be made to work, as in the
proposed system the work of tracking who owns what coins
is paid for by seigniorage, which requires inflation.
If you're having trouble with the inflation issue, it's easy to tweak it for
transaction fees instead. It's
