1. Jul 19, 2016
    • Arkadiy Paronyan's avatar
      More performance optimizations (#1649) · 4e447ccc
      Arkadiy Paronyan authored
      * 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
      4e447ccc
    • Nikolay Volf's avatar
      Removing unused client code (#1645) · 459dcbce
      Nikolay Volf authored
      * moving ipc deriving to trait
      
      * refactoring of the client
      459dcbce
    • Gav Wood's avatar
      Asynchronous transactions (polling based for now). (#1652) · 3ba3dd38
      Gav Wood authored
      * 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.
      3ba3dd38
  2. Jul 18, 2016
  3. Jul 17, 2016
  4. Jul 16, 2016
  5. Jul 15, 2016
  6. Jul 14, 2016
    • Tomasz Drwięga's avatar
      Updating UI · 66f8038b
      Tomasz Drwięga authored
      66f8038b
    • asynchronous rob's avatar
      d5d0cb0b
    • asynchronous rob's avatar
      In-memory trie operations (#1408) · 517c705a
      asynchronous rob authored and Arkadiy Paronyan's avatar Arkadiy Paronyan committed
      * 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
      517c705a