Jump to "New things here" if you're already up to speed on CT and just
want the big news.
Back in 2013 Adam Back proposed that Bitcoin and related systems could
use additive homomorphic commitments instead of explicit amounts in
place of values in transactions for improved privacy. (
https://b
>
> This is actually incorrect. There are two transactions involved in LN. The
> funding transaction, which opens a payment channel, and a commitment
> transaction, which closes the channel when broadcasted to the network (the
> cooperative closing transaction can be considered a commitment transac
I have been working on filesystem based on Mandelbrots formula, and it seems
that it is a prime candidate for extending the bitcoin algorithm.
Would like to run some of this by you folks.
The key is that the Mandelbrot workers could help to modify the verification
work so that the brute fo
> OK, so nForkId 0 is exactly the "valid on all chains" specifier I was asking
> about, cool. And your LN example (and nLockTime txs in general) illustrate
> why it's preferable to implement a generic replay protection scheme like
> yours in advance, rather than before each fork: all ad hoc RP
