Re: [Bitcoin-development] Version bits proposal

2015-05-27 Thread Patrick Strateman
There is absolutely no reason to do this. Any reasonable micro-controller can build merkle tree roots significantly faster than is necessary. 1 Th/s walks the nonce range once every 4.3ms. The largest valid merkle trees are 14 nodes high. That translates to 28 SHA256 ops per 4.3ms or 6511 SHA25

Re: [Bitcoin-development] CTxIn::nSequence

2013-06-20 Thread Patrick Strateman
It's well answered by this stack exchange question. http://bitcoin.stackexchange.com/questions/2025/what-is-txins-sequence On 06/20/2013 05:54 PM, Marko Otbalkana wrote: > Could anyone tell me what CTxIn::nSequence is meant for? > > Best Regards, > -Marko > > > ---

Re: [Bitcoin-development] Blockchain alternative storage

2013-06-05 Thread Patrick Strateman
If you're only interested in storing the best chain then a fairly simple schema is possible. CREATE TABLE blocks ( hash bytea NOT NULL PRIMARY KEY, index integer NOT NULL UNIQUE, CONSTRAINT block_hash_size_check CHECK ((octet_length(hash) = (256 / 8))) ); CREATE TABLE transaction_inpu