On Tue, Oct 1, 2013 at 6:58 PM, slush wrote:
> One process is asking getinfo every second as a fallback to possibly
> misconfigured blocknotify. It also calls getblocktemplate every 30 second.
>
getinfo does a bunch of stuff; with 0.9 you will be able to use
getbestblockhash instead.
> Second
> 1380610633.387730: POST / HTTP/1.1^M
> ThreadRPCServer method=getinfo
> CTxMemPool::accept() : accepted
> dc2941dd69b2f9fa2754f741dfba76489abef706bd237e3bd715181950723e4d (poolsz 1283)
> keypool reserve 15
> keypool return 15
> locktime : 5.996820 calltime : 0.000328 totaltime : 5.997148
>
I
Names clearly solve a different problem than that, but we still use them,
so they must be solving _some_ problem :p In this case they're a unique
identifier humans can remember after a bit of use and easily communicate to
each other with little room for error. Securely mapping them to public
keys
1) Generate sacrifice proof file using an app
2) Load file into browser
3) Surf
Where are the names in that design? I'm not sure where NameCoin comes into
this. The point of a sacrifice is it's an anonymous identity, there's no
point attaching a name to it.
BTW I keep phone numbers in an address
Fair enough, though people still manage okay with phone numbers. And a
decentralized naming system seems to come at great cost - with namecoin you
need the whole blockchain to resolve names without trust. Strip out a bell
and whistle - meaningfulness and transferability of names - and you get a
s
Interesting observation, thanks.
I'd think any competent implementation of such an identity scheme would not
involve end users directly handling randomized nonsense words, however. I
always imagined a sacrifice as being a file that you make with a GUI tool
and load into a browser extension.
On T
A couple more thoughts on this:
1) Both c and k can be kept if c is pronounced 'ch', giving ~10.9 bits per
phoneme.
2) An extra phoneme (4 encode 43 bits total) gives room to put extra
information into the name, e.g. the first 5 bits could be input as the key
to a PRP that permutes the last 38 bac
The location of a tx in the blockchain can be encoded in n=log2(h)+log2(t)
bits, where h is the block height, and t is the number of transactions in
the block. Currently h~250,000 and t~500, so n~27. A CVC phoneme encodes
~10.7 bits *, so a transaction today can be located in the blockchain with
8 matches
Mail list logo
