Updated version to v2.1.0.

README.md

@@ -1,7 +1,27 @@
-# Bitcoin Verde v2.0.0
+# Bitcoin Verde v2.1.0
 
 ## Patch Notes
 
+**v2.1.0**
+- FastSync support and UTXO Commitment generation.
+- Implemented Electrum protocol server/support.
+- Enabled Testnet configuration.
+- Now supports configurable Block size.
+- Double Spend Proof support.
+- ECIES encrypt/decrypt module.
+- Prototype block validation / BitBalancer support.
+- Memo support for explorer/indexer.
+- SPV mode.
+- Fixed validation of SLP transactions with excessive SLP amounts.
+- Added support for preferred node peers.
+- Improved Block download logic/optimizations.
+- RPC now supports HTTP (i.e. Bitcoin Core) request format.
+
+**v2.0.1**
+- Minor bug fixes.
+- Minor performance improvements.
+  - Updated for ASERT reference block.
+
 **v2.0.0**
 - Non-Indexing Module
     - Reduced disk footprint to less than 300GB.

build.gradle

@@ -1,5 +1,5 @@
 group 'com.softwareverde'
-version '2.0.1'
+version '2.1.0'
 
 apply plugin: 'java'
 apply plugin: 'java-library'

src/main/java/com/softwareverde/bitcoin/server/main/BitcoinConstants.java

@@ -92,7 +92,7 @@ protected Default(final String genesisBlockHash, final Long genesisBlockTimestam
         final Long defaultBlockVersion = 0x04L;
         final Long defaultTransactionVersion = 0x02L;
         final Integer defaultProtocolVersion = 70015;
-        final String defaultUserAgent = "/Bitcoin Verde:2.0.1/";
+        final String defaultUserAgent = "/Bitcoin Verde:2.1.0/";
         final String coinbaseMessage = "/pool.bitcoinverde.org/VERDE/";
 
         // NOTE: This UTXO Commitments were generated with storing the blockHeight in the 7th bit, not 0th bit; were calculated with off-by-one blockHeight.

src/test/java/com/softwareverde/bitcoin/block/merkleroot/MerkleTreeTests.java

@@ -123,11 +123,9 @@ private void _should_create_partial_tree_for_missing_transaction_N_with_item_cou
         // Setup
         final Item newItem = new Item(-1);
 
-        final MutableList<Item> items = new MutableList<>(itemCount);
         final MutableMerkleTree<Item> merkleTree = new MerkleTreeNode<>();
         for (int i = 0; i < itemCount; ++i) {
             final Item item = new Item(i);
-            items.add(item);
             merkleTree.addItem(item);
         }
 
@@ -407,7 +405,19 @@ public void should_create_partial_tree_for_coinbase_transaction_with_item_count_
 
     @Test
     public void should_create_partial_tree_for_coinbase_transaction_with_item_count_1() {
-        _should_create_partial_tree_for_missing_transaction_N_with_item_count_M(0, 1, 0);
+        // Setup
+        final Item item = new Item(0);
+        final MutableMerkleTree<Item> merkleTree = new MerkleTreeNode<>();
+        merkleTree.addItem(item);
+
+        // Action
+        final List<Sha256Hash> partialMerkleTree = merkleTree.getPartialTree(0);
+
+        // Assert
+        Assert.assertEquals(1, partialMerkleTree.getCount());
+        final MerkleRoot expectedMerkleRoot = merkleTree.getMerkleRoot();
+
+        Assert.assertEquals(expectedMerkleRoot, item.getHash());
     }
 
     @Test