forked from cheng/wallet
This commit is contained in:
parent
e6fc13d078
commit
3ce4e28fc6
@ -966,7 +966,7 @@ Monero did OK, because it is the leading privacy coin. It has a niche, but
|
|||||||
cannot break out of the not very large niche. Because its privacy mechanism means it is
|
cannot break out of the not very large niche. Because its privacy mechanism means it is
|
||||||
a worse Bitcoin than Bitcoin in other respects.
|
a worse Bitcoin than Bitcoin in other respects.
|
||||||
|
|
||||||
And the cold start problem means we cannot directly take over that niche either.
|
And the cold start problem means we cannot directly take over Monero's niche either.
|
||||||
|
|
||||||
But our proposed privacy mechanism means we have a tech advantage over both
|
But our proposed privacy mechanism means we have a tech advantage over both
|
||||||
Bitcoin and Monero - better contract capability than Bitcoin or Ether, because
|
Bitcoin and Monero - better contract capability than Bitcoin or Ether, because
|
||||||
@ -975,10 +975,25 @@ with a costly proof of fulfillment, and without revealing everything to the
|
|||||||
network, and without the rest of the network needing to know what that there was
|
network, and without the rest of the network needing to know what that there was
|
||||||
a contract, what that contract is nor to be able to evaluate it.
|
a contract, what that contract is nor to be able to evaluate it.
|
||||||
Because of its privacy mechanism,
|
Because of its privacy mechanism,
|
||||||
|
|
||||||
Monero cannot do contracts, which prevents atomic exchange between Monero
|
Monero cannot do contracts, which prevents atomic exchange between Monero
|
||||||
and Bitcoin, and prevents Monero from doing a lightning network that would
|
and Bitcoin, and prevents Monero from doing a lightning network that would
|
||||||
enable fast atomic exchange between itself and Bitcoin lightning.
|
enable fast atomic exchange between itself and Bitcoin lightning.
|
||||||
|
|
||||||
|
In order to do atomic exchanges between two blockchains, which is to say,
|
||||||
|
to enable people to move value between one blockchain and another without
|
||||||
|
registering for Know Your Customer, have to have contracts on the blockchain.
|
||||||
|
|
||||||
|
In order to provide DeFi markets for the exchange of fiat for crypto currency,
|
||||||
|
have to have contracts on the blockchain.
|
||||||
|
|
||||||
|
In order to have a lightning network, have to have contracts on the blockchain.
|
||||||
|
|
||||||
|
To compete, have provide people with an off ramp and on ramp to bitcoin,
|
||||||
|
in the expectation that there will in due course the off ramp will be
|
||||||
|
a whole lot busier than the on ramp. If no contracts on the blockchain, no ramp,
|
||||||
|
making it a whole lot harder to solve Metcalfe’s law and the cold start problem.
|
||||||
|
|
||||||
So if we get a niche, get differentiation from Monero and Bitcoin,
|
So if we get a niche, get differentiation from Monero and Bitcoin,
|
||||||
we can then break out of that niche and eat Monero, being a better
|
we can then break out of that niche and eat Monero, being a better
|
||||||
privacy coin, a better Monero, and from the Monero niche eat Bitcoin,
|
privacy coin, a better Monero, and from the Monero niche eat Bitcoin,
|
||||||
|
@ -262,24 +262,7 @@ that the ones used to sort and identify things are always
|
|||||||
positive in practice, and one may consider a utf
|
positive in practice, and one may consider a utf
|
||||||
string to be a very long Dewey decimal sequence.
|
string to be a very long Dewey decimal sequence.
|
||||||
|
|
||||||
### SQL blobs.
|
|
||||||
|
|
||||||
In order for blobs in a database representing bitfields to sort
|
|
||||||
correctly, we do not use seven bit nibbles, but eight bit bytes,
|
|
||||||
with a final byte representing zero to seven bits as an eight bit byte.
|
|
||||||
|
|
||||||
For this we use the mapping:
|
|
||||||
Where if\
|
|
||||||
$j$ is the bitfield interpreted as a number\
|
|
||||||
$m$ is the length of the bitfield\
|
|
||||||
$c$ is a count of the set bits in the bitfield
|
|
||||||
|
|
||||||
The value of the eight bit field is:\
|
|
||||||
$j*(2^{(7-m)}-1)+c$
|
|
||||||
|
|
||||||
The difference is that blob is preceded by a count field
|
|
||||||
that is not used in the sort order, which is tricky to
|
|
||||||
do in a Merkle-patricia tree representing an sql index.
|
|
||||||
|
|
||||||
## Use case
|
## Use case
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user