* Use tree index for DB
* Set uncles_hash, tx_root, receipts_root from verified block
* Use Filth instead of a bool
* Fix empty root check
* Flush block queue properly
* Expunge deref
* Asynchronous transactions (polling based for now).
- Alter eth_sendTransaction to be async, returning one of:
- Transaction hash (signed and submitted).
- Transaction promise ID (< 32 bytes).
- Zero hash (will never be signed).
- Introduce new JSONRPC eth_checkTransaction.
The new API call takes a single argument - a promise ID. It returns
either:
- Transaction hash (signed and submitted).
- null (still pending, call again later),
- Zero hash (will never be signed).
* New RPC eth_postTransaction
- Restore previous semantics of sendTransaction.
- Introduce eth_postTransaction.
- Some refactoring.
* Fix minor lockup.
* Use TransientHashMap to prevent leak.
* Multi-mode logging.
Better for miners (they get immediate notification of new block).
Better for general use (less superfluous information shown).
* Remove comment.
[ci:skip]
* Minor string change
[ci:skip]
* Minor message tweak.
* Minor tweaks and indentation fix.
* Minor additions to allow resetting of code.
* Add test.
* Provisional DAO hard-fork proposal.
* Change to reflect latest HF spec.
* Include extradata restrictions and overrides.
* Introduce new tests.
* Update tests to new spec format.
* Allow JSON chain spec fields to be optional.
* Remove superfluous definitions. Fix overflow risk.
* Fix build.
* Add missing file.
* Remove old flag.
* Update to latest address set.
* Update tests and test spec to latest.
Change the mining default to release only on own transactions.
* small cleanups in trie
* Memory trie skeleton
* decode nodes from RLP
* memorytrie -> memorytriedb
* implement Trie for MemoryTrie
* partially implement insert
* implement trie insertion
* don't load whole trie into memory, lookup across memory and db
* re-implement insertion and lazily load necessary nodes from DB
* node removal w/o fixing
* reduce churn in node storage
* finish remove implementation
* committing the in-memory trie
* reload root node after commit
* generate elastic arrays when converting nodes to rlp
* port triedbmut tests over to memorytriedb, fix a few bugs.
* hash count and dirty flag
* initial attempt for node inspection
* back to skeleton
* inspection framework
* implement insertion
* no panic paths in insert
* implement deletion without fixing
* node fixing
* commit nodes to db
* tracing targets and bugfix
* get tests to pass with a lot of tracing
* set playpen iterations to 10
* remove some tracing statements
* make TrieMut::root take &mut self
* replace triedbmut with memorytriedb
* treat empty insert value as removal
* add test for null insert
* fix some style concerns
* trie: use nodehandle for root_node, minor cleanup
